CPU Scheduling with a Round Robin Algorithm Based on an Effective Time Slice

Mohammad M. Tajwar, Md. Nuruddin Pathan, Latifa Hussaini and Adamu Abubakar
Volume: 13, No: 4, Page: 941 ~ 950, Year: 2017
10.3745/JIPS.01.0018
Keywords: Average Turnaround Time, Average Waiting Time, CPU Processing Time, Round Robin Algorithm, Quantum Time
Full Text:

Abstract
The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there are other CPU scheduling algorithms based on processing time which use different criteria, the round robin algorithm has gained much popularity due to its optimal time-shared environment. The effectiveness of this algorithm depends strongly on the choice of time quantum. This paper presents a new effective round robin CPU scheduling algorithm. The effectiveness here lies in the fact that the proposed algorithm depends on a dynamically allocated time quantum in each round. Its performance is compared with both traditional and enhanced round robin algorithms, and the findings demonstrate an improved performance in terms of average waiting time, average turnaround time and context switching.

Article Statistics
Multiple requests among the same broswer session are counted as one view (or download).
If you mouse over a chart, a box will show the data point's value.


Cite this article
IEEE Style
Mohammad M. Tajwar, Md. Nuruddin Pathan, Latifa Hussaini, and Adamu Abubakar, "CPU Scheduling with a Round Robin Algorithm Based on an Effective Time Slice," Journal of Information Processing Systems, vol. 13, no. 4, pp. 941~950, 2017. DOI: 10.3745/JIPS.01.0018.

ACM Style
Mohammad M. Tajwar, Md. Nuruddin Pathan, Latifa Hussaini, and Adamu Abubakar, "CPU Scheduling with a Round Robin Algorithm Based on an Effective Time Slice," Journal of Information Processing Systems, 13, 4, (2017), 941~950. DOI: 10.3745/JIPS.01.0018.