International Journal of Computer Science & Network Security

International Journal of Computer Science & Network Security (국제컴퓨터통신보호논문지학회)
권호 표지
DOI QR코드

DOI QR Code

A Review on the CPU Scheduling Algorithms: Comparative Study

  • Ali, Shahad M. (Computer Science Department, College of Science and Humanities, Imam Abdulrahman Bin Faisal University) ;
  • Alshahrani, Razan F. (Computer Science Department, College of Science and Humanities, Imam Abdulrahman Bin Faisal University) ;
  • Hadadi, Amjad H. (Computer Science Department, College of Science and Humanities, Imam Abdulrahman Bin Faisal University) ;
  • Alghamdi, Tahany A. (Computer Science Department, College of Science and Humanities, Imam Abdulrahman Bin Faisal University) ;
  • Almuhsin, Fatimah H. (Computer Science Department, College of Science and Humanities, Imam Abdulrahman Bin Faisal University) ;
  • El-Sharawy, Enas E. (Computer Science Department, College of Science and Humanities, Imam Abdulrahman Bin Faisal University)
  • Received : 2021.01.05
  • Published : 2021.01.30
Download PDF
⟨ Previous Next ⟩

Abstract

CPU is considered the main and most important resource in the computer system. The CPU scheduling is defined as a procedure that determines which process will enter the CPU to be executed, and another process will be waiting for its turn to be performed. CPU management scheduling algorithms are the major service in the operating systems that fulfill the maximum utilization of the CPU. This article aims to review the studies on the CPU scheduling algorithms towards comparing which is the best algorithm. After we conducted a review of the Round Robin, Shortest Job First, First Come First Served, and Priority algorithms, we found that several researchers have suggested various ways to improve CPU optimization criteria through different algorithms to improve the waiting time, response time, and turnaround time but there is no algorithm is better in all criteria.

Keywords

References

  1. Galvin, P. B., Gagne, G., & Silberschatz, A. (2003). Operating system concepts. John Wiley & Sons.
  2. Abbas, A. (2015). Multiprocessor and Real-Time Scheduling Shortest-Job-First (SJF) Scheduling Algorithm. European Journal of Computer Science and Information Technology, 3(5), 8-20.
  3. Kamalam, G. K., & Bhaskaran, D. V. M. (2014). Resource Fitness Task Scheduling Algorithm for Scheduling Tasks on Heterogeneous Grid Environment. Australian Journal of Basic and Applied Sciences, 8(18), 128-135.
  4. Siahaan, A. P. U. (2016). Comparison analysis of CPU scheduling: FCFS, SJF and Round Robin. International Journal of Engineering Development and Research, 4(3), 124-132.
  5. M Mostafa, S., & Amano, H. (2020). Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique. Applied Sciences, 10(15), 5134. https://doi.org/10.3390/app10155134
  6. Farooq, M. U., Shakoor, A., & Siddique, A. B. (2017, March). An efficient dynamic round robin algorithm for cpu scheduling. In 2017 International Conference on Communication, Computing and Digital Systems (CCODE) (pp. 244-248). IEEE.
  7. Zouaoui, S., Boussaid, L., & Mtibaa, A. (2019). Priority based round robin (PBRR) CPU scheduling algorithm. International Journal of Electrical & Computer Engineering (2088-8708), 9(1).Technologies and Optimization (Trends and Future Directions)(ICRITO) (pp. 397-400). IEEE. https://doi.org/10.11591/ijece.v9i1.pp397-401
  8. Gupta, A. K., Yadav, N. S., & Goyal, D. (2016). Design and Performance Evaluation of Smart Job First Dynamic Round Robin (SJFDRR) Scheduling Algorithm with Smart Time Quantum. American Scientific Research Journal for Engineering, Technology, and Sciences (ASRJETS), 26(4), 66-78.
  9. Manuel, J. I., Baquirin, R. B., Guevara, K. S., & Tandingan, D. (2019, February). Fittest Job First Dynamic Round Robin (FJFDRR) scheduling algorithm using dual queue and arrival time factor: a comparison. In IOP Publishing Ltd, IOP Conf. Ser.: Mater. Sci. Eng (Vol. 482, p. 012046). https://doi.org/10.1088/1757-899X/482/1/012046
  10. Khatri, J. (2016). An enhanced Round Robin CPU scheduling algorithm. IOSR Journal of Computer Engineering (IOSR-JCE), 18(4), 20-24. https://doi.org/10.9790/0661-1804022024
  11. Srilatha, N., Sravani, M., & Divya, Y. (2017). Optimal Round Robin CPU Scheduling Algorithm Using Manhattan Distance. International Journal of Electrical and Computer Engineering, 7(6), 3664 https://doi.org/10.11591/ijece.v7i6.pp3664-3668
  12. Ali, K. F., Marikal, A., & Kumar, K. A. A Hybrid Round Robin Scheduling Mechanism for Process Management. International Journal of Computer Applications, 975, 8887.
  13. Pratap, R., & Zaidi, T. (2018, August). Comparative study of task scheduling algorithms through Cloudsim. In 2018 7th International Conference on Reliability, Infocom
  14. Srujana, R., Roopa, Y. M., & Mohan, M. D. S. K. (2019, April). Sorted Round Robin Algorithm. In 2019 3rd International Conference on Trends in Electronics and Informatics (ICOEI) (pp. 968-971). IEEE.
  15. Biswas, D., & Samsuddoha, M. (2019). Determining Proficient Time Quantum to Improve the Performance of Round Robin Scheduling Algorithm. International Journal of Modern Education and Computer Science, 11(10), 33. https://doi.org/10.5815/ijmecs.2019.10.04
  16. Shafi, U., Shah, M. A., Wahid, A., Abbasi, K., Javaid, Q., Asghar, M., & Haider, M. (2020). A novel amended dynamic round robin scheduling algorithm for timeshared systems. Int. Arab J. Inf. Technol., 17(1), 90-98.
  17. Aijaz, M., Tariq, R., Ghori, M., Rizvi, S. W., & Qazi, E. F. (2019, March). Efficient Round Robin Algorithm (ERRA) using the Average Burst Time. In 2019 International Conference on Information Science and Communication Technology (ICISCT) (pp. 1-5). IEEE.
  18. Mody, S., & Mirkar, S. (2019, December). Smart Round Robin CPU Scheduling Algorithm For Operating Systems. In 2019 4th International Conference on Electrical, Electronics, Communication, Computer Technologies and Optimization Techniques (ICEECCOT) (pp. 309-316). IEEE.
  19. Parekh, H. B., & Chaudhari, S. (2016, December). Improved Round Robin CPU scheduling algorithm: Round Robin, Shortest Job First and priority algorithm coupled to increase throughput and decrease waiting time and turnaround time. In 2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication (ICGTSPICC) (pp. 184-187). IEEE.
  20. Alworafi, M. A., Dhari, A., Al-Hashmi, A. A., & Darem, A. B. (2016, December). An improved SJF scheduling algorithm in cloud computing environment. In 2016 International Conference on Electrical, Electronics, Communication, Computer and Optimization Techniques (ICEECCOT) (pp. 208-212). IEEE.
  21. Joshi, A., & Gosswami, S. (2017). Modified Round Robin algorithm by using Priority Scheduling. Advances in Computational Sciences and technology, 10(6), 1543-1549.
  22. Zouaoui, S., Boussaid, L., & Mtibaa, A. (2019). Priority based round robin (PBRR) CPU scheduling algorithm. International Journal of Electrical & Computer Engineering (2088-8708), 9(1).
  23. Berhanu, Y., Alemu, A., & Mishra, M. K. (2017). Dynamic time quantum based round robin CPU scheduling algorithm (Doctoral dissertation).
  24. Omotehinwa, T. O., Azeez, I., & Oyekanmi, E. O. (2019). An Improved Round Robin CPU Scheduling Algorithm for Asymmetrically Distributed Burst Times.
  25. Berhanu, Y., Alemu, A., & Mishra, M. K. (2017). Dynamic time quantum based round robin CPU scheduling algorithm (Doctoral dissertation).
  26. Bibu, G. D., & Nwankwo, G. C. (2019). COMPARATIVE ANALYSIS BETWEEN FIRST-COME-FIRST-SERVE (FCFS) AND SHORTEST-JOB-FIRST (SJF) SCHEDULING ALGORITHMS.
  27. Magdalene, R., & Sridharan, D. (2020). Comparative Analysis of FCFS and SJF for Multimedia Process Scheduling. In Advances in Communication Systems and Networks (pp. 639-646). Springer, Singapore.
  28. Kumar, S., Kumar, G., Jain, K., & Jain, A. (2018). An approach to reduce turn around time and waiting time by the selection of round robin and shortest job first algorithm. International Journal of Engineering & Technology, 7(2.8), 667-672. https://doi.org/10.14419/ijet.v7i2.8.10553
  29. Chandra Shekar, N., & Karthik, V. (2017). Analysis of Priority Scheduling Algorithm on the Basis of FCFS & SJF for Similar Priority Jobs. International Journal of Engineering Research in Computer Science and Engineering (IJERCSE), 4(3).
  30. Chauhan, H., & Inani, A. (2019, June). Modified Concept to Achieve Maximum Efficiency of CPU Scheduling Algorithm. In 2019 3rd International conference on Electronics, Communication and Aerospace Technology (ICECA) (pp. 660-663). IEEE.
  31. Teraiya, J., & Shah, A. (2018, September). Comparative Study of LST and SJF Scheduling Algorithm in Soft Real-Time System with its Implementation and Analysis. In 2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI) (pp. 706-711). IEEE.
  32. Garg, S., & Kumar, D. (2018, July). A k-Factor CPU Scheduling Algorithm. In 2018 9th International Conference on Computing, Communication and Networking Technologies (ICCCNT) (pp. 1-6). IEEE.
  33. Goel, N., & Garg, R. B. (2013). A comparative study of cpu scheduling algorithms. arXiv preprint arXiv:1307.4165.
  34. Adekunle, Y. A., Ogunwobi, Z. O., Jerry, A. S., Efuwape, B. T., Ebiesuwa, S., & Ainam, J. P. (2014). A comparative study of scheduling algorithms for multiprogramming in real-time systems. International Journal of Innovation and Scientific Research, 12(1), 180-185.
  35. Pushpraj, S., Vinod, S., & Anjani, P. (2014). Analysis and Comparison of CPU Scheduling Algorithms. International Journal of Research in Engineering & Technology (IJRET) Vol, 4(1).
  36. Dash, A. R., & Samantra, S. K. (2016). An optimized round Robin CPU scheduling algorithm with dynamic time quantum. arXiv preprint arXiv:1605.00362.
  37. Putra, T. D. Analysis of Preemptive Shortest Job First (SJF) Algorithm in CPU Scheduling.
  38. Hamayun, M., & Khurshid, H. (2015). An optimized shortest job first scheduling algorithm for CPU scheduling. J. Appl. Environ. Biol. Sci, 5(12), 42-46.
  39. Sowmya, G., ChinaAppalaNaidu, R., Meghana, K., & Bandi, R. (2018). A COMPARISON OF SCHEDULING ALGORITHM FOR BEST UTILIZATION OF MEMORY. International Journal of Pure and Applied Mathematics, 120(6), 3563-3570.
  40. Krishna, M. V. (2018). BigData Processing using First Come First Served (FCFS) Algorithm. International Journal of Computer Science and Mobile Computing, 7(7), 83-87.
  41. Chandiramani, K., Verma, R., & Sivagami, M. (2019). A Modified Priority Preemptive Algorithm for CPU Scheduling. Procedia Computer Science, 165, 363-369. https://doi.org/10.1016/j.procs.2020.01.037
  42. Tripathi, S., Prajapati, S., & Ansari, N. A. (2017, May). Modified optimal algorithm: for load balancing in cloud computing. In 2017 International Conference on Computing, Communication and Automation (ICCCA) (pp. 116-121). IEEE.
  43. Zhang, J., Chen, C., Zheng, H. K., & Luo, Q. Y. (2019, June). A High Priority Random Task Fuzzy Scheduling Algorithm for CPS. In 2019 Chinese Control And Decision Conference (CCDC) (pp. 482-487). IEEE.