Volume 12, Issue 1, November 2014, Pages 180–185
Y.A. Adekunle1, Z.O. Ogunwobi2, A. Sarumi Jerry3, B.T. Efuwape4, Seun Ebiesuwa5, and Jean-Paul Ainam6
1 Department of Computer Science, Babcock University Ilishan-Remo, Ogun State, Nigeria
2 Department of Mathematical Sciences, Olabisi Onabanjo University, Ago Iwoye, Ogun State, Nigeria
3 Department of Computer Science, Lagos State Polytechnic, Ikorodu, Lagos State, Nigeria
4 Department of Mathematical Sciences, Olabisi Onabanjo University, Ago Iwoye, Ogun State, Nigeria
5 Department of Computer Science, Babcock University Ilishan-Remo, Ogun State, Nigeria
6 Department of Computer Science, Babcock University Ilishan-Remo, Ogun State, Nigeria
Original language: English
Copyright © 2014 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Scheduling algorithms allow one to decide which threads are given to resource from moment to moment. Various process scheduling algorithms exist and this paper focuses on the scheduling algorithms used for scheduling processes in a multiprogramming system namely First-Come-First-Served (FCFS), Round Robin (RR), Shortest Job First (SJF), Shortest Remaining Time First (SRTF) and Lottery scheduling. Each algorithm has been discussed and a comparison was made on the basis of eight (8) parameters significant in processes scheduling. In fact, compared to other papers, this research made use of more parameters for the analysis. These parameters include CPU utilization, throughput, waiting time, response time, fairness, starvation, predictability and preemption. From this analysis, we showed that there is actually no scheduling algorithm satisfying the conditions of an ideal algorithm and concluded that further studies which improve current scheduling algorithms need to be done.
Author Keywords: First-come-first-served, Round robin, shortest job first, shortest remaining time first and Lottery scheduling.
Y.A. Adekunle1, Z.O. Ogunwobi2, A. Sarumi Jerry3, B.T. Efuwape4, Seun Ebiesuwa5, and Jean-Paul Ainam6
1 Department of Computer Science, Babcock University Ilishan-Remo, Ogun State, Nigeria
2 Department of Mathematical Sciences, Olabisi Onabanjo University, Ago Iwoye, Ogun State, Nigeria
3 Department of Computer Science, Lagos State Polytechnic, Ikorodu, Lagos State, Nigeria
4 Department of Mathematical Sciences, Olabisi Onabanjo University, Ago Iwoye, Ogun State, Nigeria
5 Department of Computer Science, Babcock University Ilishan-Remo, Ogun State, Nigeria
6 Department of Computer Science, Babcock University Ilishan-Remo, Ogun State, Nigeria
Original language: English
Copyright © 2014 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract
Scheduling algorithms allow one to decide which threads are given to resource from moment to moment. Various process scheduling algorithms exist and this paper focuses on the scheduling algorithms used for scheduling processes in a multiprogramming system namely First-Come-First-Served (FCFS), Round Robin (RR), Shortest Job First (SJF), Shortest Remaining Time First (SRTF) and Lottery scheduling. Each algorithm has been discussed and a comparison was made on the basis of eight (8) parameters significant in processes scheduling. In fact, compared to other papers, this research made use of more parameters for the analysis. These parameters include CPU utilization, throughput, waiting time, response time, fairness, starvation, predictability and preemption. From this analysis, we showed that there is actually no scheduling algorithm satisfying the conditions of an ideal algorithm and concluded that further studies which improve current scheduling algorithms need to be done.
Author Keywords: First-come-first-served, Round robin, shortest job first, shortest remaining time first and Lottery scheduling.
How to Cite this Article
Y.A. Adekunle, Z.O. Ogunwobi, A. Sarumi Jerry, B.T. Efuwape, Seun Ebiesuwa, and Jean-Paul Ainam, “A Comparative Study of Scheduling Algorithms for Multiprogramming in Real-Time Systems,” International Journal of Innovation and Scientific Research, vol. 12, no. 1, pp. 180–185, November 2014.
