Google scholar arxiv informatics ads IJAIS publications are indexed with Google Scholar, NASA ADS, Informatics et. al.

Call for Paper


January Edition 2023

International Journal of Applied Information Systems solicits high quality original research papers for the January 2023 Edition of the journal. The last date of research paper submission is December 15, 2022.

An Improved CPU Scheduling Algorithm

Himanshi Arora, Deepanshu Arora, Bagish Goel, Parita Jain Published in Parallel Processing

International Journal of Applied Information Systems
Year of Publication: 2013
© 2013 by IJAIS Journal
Download full text
  1. Himanshi Arora, Deepanshu Arora, Bagish Goel and Parita Jain. Article: An Improved CPU Scheduling Algorithm. International Journal of Applied Information Systems 6(6):7-9, December 2013. BibTeX

    	author = "Himanshi Arora and Deepanshu Arora and Bagish Goel and Parita Jain",
    	title = "Article: An Improved CPU Scheduling Algorithm",
    	journal = "International Journal of Applied Information Systems",
    	year = 2013,
    	volume = 6,
    	number = 6,
    	pages = "7-9",
    	month = "December",
    	note = "Published by Foundation of Computer Science, New York, USA"


In multiprogramming systems i. e. in systems where several processes reside in memory, organization of processes is very important so that CPU always has one to execute. CPU scheduling is the base of multiprogramming operating systems. CPU executes one process at a time and switches between processes to improve CPU utilization. CPU scheduling strategies help in selecting the next process to be executed by the CPU. CPU scheduling is one of the most important activities performed by operating system which helps in increasing the throughput of the computer system therefore if the performance of scheduling will improve then our computer system will become more productive. In this paper, CPU scheduling algorithm with improved performance has been proposed. The technique which is used for increasing the speed up factor is 'Pipelining'. This technique can be applied to any CPU scheduling algorithm to improve its performance. The analysis shows that the proposed algorithm is better than the existing scheduling algorithms. The performance is improved by 40-50%.


  1. Bashir Alam, "Fuzzy Round Robin CPU Scheduling Algorithm", Journal of Computer Science, pp. 1079-1085, 2013.
  2. Devendra Thakor, Apurva Shah, "D_EDF: An efficient Scheduling Algorithm for Real-Time Multiprocessor System", IEEE, pp. 1044-1049, 2011.
  3. Saeede Bibi, Farooque Azam, Yasir Chaudhry, "Combinatory CPU Scheduling Algorithm", 2010.
  4. Sindhu M, Rajkamal R, Vigneshwaran P, "An Optimum Multilevel CPU Scheduling Algorithm", International Conference on Advances in Computer Engineering, pp. 90-94, 2010
  5. Radhakrishna Naik, R. R. Manthalkar, Mukta Dhopeshwarkar, "Modified IUF Scheduling Algorithm for Real Time Systems", IEEE, pp. 712-716, 2010.
  6. Apurva Shah, Ketan Kotecha, "Adaptive Scheduling Algorithm for Real Time Multiprocessor Systems", IEEE, pp. 35-39, 2009.
  7. E. O. Oyetunji, A. E. Oluleye, "Performance Assessment of some CPU Scheduling Algorithms", 2009.
  8. Ruben Gran, Enric Morancho, Àngel Olive, Jose M. Llaberia, "An Enhancement for a Scheduling Logic Pipelined over two Cycles", IEEE, 2006.
  9. Shantanu Dutt, "Pipeline Basics", www. ece. uic. edu/~dutt/courses/ece366/lect14-pipe1. pdf
  10. M. Morris, Mano, "Pipeline and Vector Processing", Computer System Architecture, 3rd Edition, Dorling Kindersley (India) Pvt. Ltd. , p. 301-330.
  11. Toan Nguyen, "Pipelining", www. cs. sjsu. edu/~lee/cs147/Pipelining%20Toan. ppt
  12. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, "CPU Scheduling", Operating System Concepts, 6th Edition, John Wiley &Sons, p. 151-183


Pipelining, Average waiting time, Burst time, Priority scheduling, Round -Robin scheduling, etc.