AIRCC's International Journal of Computer Science and Information Technology

Open Access Open Access  Restricted Access Subscription Access

Comparative Analysis of FCFS, SJN & RR Job Scheduling Algorithms


Affiliations
1 Computer Science Department, Kaduna State University, Nigeria
2 Computer Department, FCE Pankshin, Nigeria
 

One of the primary roles of the operating system is job scheduling. Oftentimes, what makes the difference between the performance of one operating system over the other could be the underlying implementation of its job scheduling algorithm. This paper therefore examines, under identical conditions and parameters, the comparative performances of First Come First Serve (FCFS), Shortest Job Next (SJN) and Round Robin (RR) scheduling algorithms. Simulation results presented in this paper serve to stimulate further research into the subject area.

Keywords

Scheduling, Task, Thread, Process, Algorithm, Operating Systems, Scheduling.
User
Notifications
Font Size

  • A. S. Tanenbaum, Modern Operating System, Pearson Education, Inc, 2009.

  • C. Sun, M. T. Wade, Y. Lee, J. S. Orcutt, L. Alloatti, M. S. Georgas, A. S. Waterman and M. B.R., “Single-chip Microprocessor That Communicates Directly Using Light,” Nature, p. 534, 2015.

  • A. Silberschatz, B. G. Peter and G. Greg, Operating System Concepts Essentials, John Wiley & Sons, Inc, 2014.

  • D. Dodge, A. Danko, S. Marineau-Mes, P. V. D. Veen, C. Burgess, T. Fletcher and B. Stecher, “Adaptive Partitioning for Operating System”. USA Patent 8,387,052, 26 February 2013.

  • S. Peter, J. Li, I. Zhang, D. R. Ports, D. Woos, A. Krishnamurthy, T. Anderson and T. Roscoe, “The Operating System is the Control Plane,” ACM Transactions on Computer Systems, p. 11, 2016.

  • M. A. Razzaque, M. Milojevic-Jevric, A. Palade and S. Clarke, “Middleware for Internet of Things: A Survey,” IEEE Internet of Things Journal, vol. 3, no. 1, pp. 70-95, 2016.

  • R. H. Arpaci-Dusseau and A. C. Arpaci-Dusseau, Operating Systems: Three Easy Pieces, Wisconsin: Arpaci-Dusseau Books, 2014.

  • N. B. Shah, K. Lee and K. Ramchandran, “When do Redundant Requests Reduce Latency?,” IEEE Transactions on Communications , pp. 715-722, 2016.

  • M.-A. Vasile, F. Pop, R.-I. Tutueanu, V. Cristea and J. Kołodziej, “Resource-aware Hybrid Scheduling Algorithm in Heterogeneous Distributed Computing,” Future Generation Computer Systems, pp. 61-71, 2015.

  • B. Fataniya and M. Patel, “Survey on Different Method to Improve Performance of the Round Robin Scheduling Algorithm,” 2018.


Abstract Views: 321

PDF Views: 168




  • Comparative Analysis of FCFS, SJN & RR Job Scheduling Algorithms

Abstract Views: 321  |  PDF Views: 168

Authors

Luhutyit Peter Damuut
Computer Science Department, Kaduna State University, Nigeria
Pam Bulus Dung
Computer Department, FCE Pankshin, Nigeria

Abstract


One of the primary roles of the operating system is job scheduling. Oftentimes, what makes the difference between the performance of one operating system over the other could be the underlying implementation of its job scheduling algorithm. This paper therefore examines, under identical conditions and parameters, the comparative performances of First Come First Serve (FCFS), Shortest Job Next (SJN) and Round Robin (RR) scheduling algorithms. Simulation results presented in this paper serve to stimulate further research into the subject area.

Keywords


Scheduling, Task, Thread, Process, Algorithm, Operating Systems, Scheduling.

References