Abstract
Operating system is the core of computer science and task scheduling is the major topic in this domain. Priority base scheduling is always remains hot topic in the domain of operating systems. In Priority base printing always higher priority given to those printings jobs which are processed more quickly rather than the lower priority base printings jobs. In this way low priority jobs are delayed again and again. In this research detail study is conducted regarding the scheduling algorithms in operating system. Priority base printings become bottlenecks who are assigned lowest priority. They may have to wait till their turn may be up to mid night in large departments. Now we are going to discuss a specific algorithm which can solve above issues in a smart way. A new method is proposed to solve the priority scheduling problems. This method is very handy for those users who are assigned a higher priority authority in printing mechanism. It also allows the lowest priority base printing to print data. In this solution we are not going to ignore the highest printing jobs. The highest priority base printing jobs will be continued in the same way. Our main objective is to maintain a balance between the high priority and low priority printing jobs without suffering from continues delay.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Macauley, R.M., Martin, T.S., Vachon, G.C., Cosgrove, P.A., Sasson, S.J., Wilson, E.D.: Distributed Printing Social Network. Google Patents (2015)
Shaw, L.F., Teng, C.-C., Sykes, K.W., Endres, R.E.: Device Independent Spooling in a Print Architecture. Google Patents (1998)
Laurent, M.S., Onischke, M., Kuindersma, M., Krishnammagaru, D., Stairs, J., Noreikis, K.: System and Method for Releasing Print Jobs Based on Location Information. Google Patents (2015)
Sanders, R.E., Frazier, D.P.: System and Method for Batch Printing High-Volume Electronic Documents from a Network. Google Patents (2010)
Gould, K.V.W., Small, G.J., Galipeau, S.R., Kirkland, C.J.: Methods and Systems for Data Prioritization. Google Patents (2014)
Zhang, D., Dechev, D.: A lock-free priority queue design based on multi-dimensional linked lists. IEEE Trans. Parallel Distrib. Syst. 27, 613–626 (2016)
Gruber, J., Träff, J.L., Wimmer, M.: Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures. arXiv preprint arXiv:1603.05047 (2016)
Lenharth, A., Nguyen, D., Pingali, K.: Priority queues are not good concurrent priority schedulers. In: European Conference on Parallel Processing, pp. 209–221 (2015)
Kinoshita, K., Higashizaki, Y.: Remote e-mail printing. Google Patents (2011)
Nan, X., He, Y., Guan, L.: Optimal resource allocation for multimedia cloud based on queuing model. In: 2011 IEEE 13th international workshop on Multimedia signal processing (MMSP), pp. 1–6 (2011)
Abaev, P., Gaidamaka, Y., Samouylov, K.E.: Queuing model for loss-based overload control in a SIP server using a hysteretic technique. In: Internet of Things, Smart Spaces, and Next Generation Networking. Springer, pp. 371–378 (2012)
Nakayama, Y., Takewa, Y., Sumikura, H., Yamanami, M., Matsui, Y., Oie, T., et al.: In-body tissue-engineered aortic valve (Biovalve type VII) architecture based on 3D printer molding. J. Biomed. Mater. Res. Part B: Appl. Biomater. 103, 1–11 (2015)
Lansing, S., Pantelias, N., Vu, Y., Gomez, F.J.: System and Method for Dropping Lower Priority Packets that are Slated for Wireless Transmission. Google Patents (2011)
Al Hanbali, A., Alvarez, E., Heijden, M.: Approximations for the waiting time distribution in an M/G/c priority queue (2013)
Stanford, D.A., Taylor, P., Ziedins, I.: Waiting time distributions in the accumulating priority queue. Queueing Syst. 77, 297–330 (2014)
Singh, C.J., Jain, M., Kumar, B.: MX/G/1 queuing model with state dependent arrival and second optional vacation. Int. J. Math. in Oper. Res. 4, 78–96 (2012)
de Souza, R.M., Morabito, R., Chiyoshi, F.Y., Iannoni, A.P.: Incorporating priorities for waiting customers in the hypercube queuing model with application to an emergency medical service system in Brazil. Eur. J. Oper. Res. 242, 274–285 (2015)
Takagi, Y., Nakagawa, M.: Printing System, Printing Method, Print Server, Control Method, and Computer-Readable Medium. Google Patents (2012)
Alistarh, D., Kopinsky, J., Li, J., Shavit, N.: The SprayList: a scalable relaxed priority queue. ACM SIGPLAN Not. 50, 11–20 (2015)
Kim, C., Choi, S.: A Study on Efficient Join Mechanism Using Streaming-Service-Time in Mobile P2P Environment (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Ahmed, A., Arif, M., Rizwan, A.R., Jabbar, M., Ahmed, Z. (2018). A Smart Way to Improve the Printing Capability of Operating System. In: Balas, V., Jain, L., Balas, M. (eds) Soft Computing Applications. SOFA 2016. Advances in Intelligent Systems and Computing, vol 633. Springer, Cham. https://doi.org/10.1007/978-3-319-62521-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-62521-8_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62520-1
Online ISBN: 978-3-319-62521-8
eBook Packages: EngineeringEngineering (R0)