Open Access Open Access  Restricted Access Subscription Access

A correlative contemplation of CPU Utilization of assorted scheduling algorithms

Chetan Sharma, Deepinder Kaur


Grid communication consists of many communication technologies and mediums and main concern of grid communication is performance evaluation. The main work of this study is to make a model for grid communication framework that calculate the CPU utilization of each computer, by applying different algorithms such as first come first serve (FCFS), shortest job first (SJF), priority algorithm and round robin (RR) and compare and contrast the CPU utilization of each algorithm so that the user is able to distinguish and make a result regarding which one is satisfactory.

Keywords: Grid communication, CPU utilization, FCFS, SJF, RR, operating system

Cite this Article

Chetan Sharma, Deepinder Kaur. A Correlative Contemplation of CPU Utilization of Assorted Scheduling Algorithms. Journal of Operating Systems Development & Trends. 2018; 5(3): 1–5p.

Full Text:



Raman et al. An Efficient Dynamic Round Robin CPU Scheduling Algorithm. International Journal of Advanced Research in Computer Science and Software Engineering (IJARCSSE). May 2014; 4(5):

Ajit Singh, Priyanka Goyal, Sahil Batra, ‖ An Optimized Round Robin Scheduling Algorithm for CPU Scheduling‖. (IJCSE) International Journal on Computer Science and Engineering. 2010; 2(7): 2383–2385p.

Silberschatz A, Galvin PB, Gagne G. Operating Systems Concepts. 2008; 7th Edn., John Wiley and Sons, USA., ISBN: 13: 978–0471694663, 944p.

Tanebaun AS. Modern Operating Systems. 3rd Edn, Prentice Hall, ISBN: 13:9780136006633, 2008;1104.

Rukhsar Khan et al. ―Analysis of Priority Scheduling Algorithm on the Basis of FCFS & SJF for Similar Priority Jobs‖. IJCSMC. Sep 2015; 4(9): 324 – 331p.

Raj Kumari et al. ―An efficient resource utilization based integrated task scheduling algorithm‖, Signal Processing and Integrated Networks (SPIN). 2017 4th International Conference, 2–3 Feb. 2017.

Saleem U, Javed MY. Simulation of CPU scheduling algorithms. 2000 TENCON Proceedings. Intelligent Systems and Technologies for the New Millennium (Cat. No.00CH37119), Kuala Lumpur, 2000; 2: 562–567p.

Saroj SK, Sharma AK, Chauhan SK. A novel CPU scheduling with variable time quantum based on mean difference of burst time. International Conference on Computing, Communication and Automation (ICCCA), Noida. 2016; 1342–1347p.


  • There are currently no refbacks.

This site has been shifted to