Performance Analysis of Hybrid CPU Scheduling Algorithm in Multi-tasking Environment

Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 828)


High performance computing systems consists of many computer resources like servers, storage memory, application softwares, processors and networks etc. When a user submits a job, he specify the type of resources he need like nodes from clusters or large memory nodes. Job schedulers allocates a priority to every job waiting in the queue. The elevated priority job sits at the peak of the queue waiting for computer resources to become obtainable. The jobs are then executed again and adjustments are made to the queue based on certain parameters and respective priority levels of jobs after fixed quantum of time. In spite of various researches in the area of scheduling and optimization, still most of algorithms suffers from problems like convoy effect, indefinite blocking or starvation. In this research paper, hybrid algorithms, namely Round Robin with Shortest Job First (RRSJF), Round Robin with First Come First Serve (RRFCFS) and Round Robin with Priority (RRPR) has been proposed to overcome such problems. Considering average waiting time and average turnaround time, a simulation based analysis of proposed algorithms was performed using C programming language. The improvement in average waiting time is more relevant with increasing the number of tasks in case of Round Robin with Shortest Job First algorithm (RRSJF). It is proved and validated by comparative analysis among proposed hybrid algorithms in results and discussion section of the research paper.


Task Resources Scheduling Time quantum Convoy effect Starvation Hybrid algorithms Average waiting time Average turnaround time 


  1. 1.
    Sangwan, S., Sangwan, S.: An effective approach on scheduling algorithm in cloud computing. Int. J. Comput. Sci. Mob. Comput. 3(6), 19–23 (2014)Google Scholar
  2. 2.
    Nasir, S., Shah, M., Zakaria, M.N.B., Kamil, A., Mahmood, B., Pal, A.J., Haron, N.: Agent based priority heuristic for job scheduling on computational grids. Procedia - Procedia Comput. Sci. 9, 479–488 (2012)CrossRefGoogle Scholar
  3. 3.
    Altubaishi, E.S.: An efficient hybrid scheduling algorithm for high speed cellular networks, no. 1, pp. 1–4 (2014)Google Scholar
  4. 4.
    Kishor, L., Goyal, D.: Comparative analysis of various scheduling algorithms. Int. J. Adv. Res. Comput. Eng. Technol. 2(4), 1488–1491 (2013)Google Scholar
  5. 5.
    Qureshi, I.: CPU scheduling algorithms: a survey. Int. J. Adv. Netw. Appl. 5, 1968–1973 (2014)Google Scholar
  6. 6.
    Patel, J., Solanki, A.K.: Performance enhancement of CPU scheduling by hybrid algorithms using genetic approach. Int. J. Adv. Res. Comput. Eng. Technol. 1(4), 142–144 (2012)Google Scholar
  7. 7.
    Sukumar Babu, B., Neelima Priyanka, N., Sunil Kumar, B.: Efficient Round Robin CPU scheduling algorithm. Int. J. Eng. Res. Dev. 4(9), 36–42 (2012)Google Scholar
  8. 8.
    Mishra, M.K.: An improved FCFS (IFCFS) disk scheduling algorithm. Int. J. Comput. Appl. 47(13), 20–24 (2012)Google Scholar
  9. 9.
    Behzad, S., Fotohi, R., Effatparvar, M.: Queue based Job scheduling algorithm for cloud computing. Int. Res. J. Appl. Basic Sci. 4(12), 3785–3790 (2013)Google Scholar
  10. 10.
    Hyytiä, E., Aalto, S.: On Round-Robin routing with FCFS and LCFS scheduling. Perform. Eval. 97, 83–103 (2016)CrossRefGoogle Scholar
  11. 11.
    Hwang, L.-C., Hsu, S.J., Wang, S.-Y., Huang, Y.-H.: A hybrid scheduling algorithm with low complexity: jumping virtual clock Round Robin, no. 1, pp. 1–6 (2005)Google Scholar
  12. 12.
    Giaccone, P., Prabhakar, B., Shah, D.: Randomized scheduling algorithms for high-aggregate bandwidth switches. IEEE J. Sel. Areas Commun. 21(4), 546–559 (2003)CrossRefGoogle Scholar
  13. 13.
    Harkut, D.G.: Comparison of different task scheduling algorithms in RTOS: a survey. Int. J. Adv. Res. Comput. Sci. Softw. Eng. 4(7), 1236–1240 (2014)Google Scholar
  14. 14.
    Srivastav, M.K., Pandey, S., Gahoi, I., Namdev, N.K.: Fair priority Round Robin with dynamic time quantum: FPRRDQ. Int. J. Mod. Eng. Res. 2(3), 876–881 (2012)Google Scholar
  15. 15.
    Yashvir, P.S., Prakash, O.: Selection of scheduling Algorithm. Int. J. Adv. Res. Comput. Sci. 1(2), 1–9 (2012)Google Scholar
  16. 16.
    Gupta, A.K.: Hybrid CPU scheduling algorithm. Int. J. Comput. Sci. Inf. Technol. 6(2), 1569–1572 (2015)Google Scholar
  17. 17.
    Akhtar, M., Hamid, B., Humayun, M.: An optimized shortest job first scheduling algorithm for CPU scheduling. J. Appl. Environ. Biol. Sci. 5(12), 42–46 (2015)Google Scholar
  18. 18.
    Somani, J.S., Chhatwani, P.K.: Comparative study of different CPU. Int. J. Comput. Sci. Mob. Comput. 2, 310–318 (2013)Google Scholar
  19. 19.
    Jain, S., Jain, S.: A review study on the CPU scheduling algorithms. Int. J. Adv. Res. Comput. Commun. Eng. 5(8), 22–31 (2016)Google Scholar
  20. 20.
    Microprocessing, N.-H., Leonardo, R.: vol. 28, pp. 211–216 (1989)Google Scholar
  21. 21.
    Rosemarry, P., Singh, R., Singhal, P., Sisodia, D.: Grouping based job scheduling algorithm using priority queue and hybrid algorithm in grid computing. Int. J. Grid Comput. Appl. 3(4), 55–65 (2012)Google Scholar
  22. 22.
    Shyam, R., Kumar, P.: Improved Round Robin with shortest job first scheduling. Int. J. Adv. Res. Comput. Sci. Softw. Eng. 5(3), 156–162 (2015)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.Department of Informatics, School of Computer Science EngineeringUniversity of Petroleum and Energy StudiesDehradunIndia

Personalised recommendations