CPU Scheduling with a Round Robin Algorithm Based on an Effective Time Slice
Mohammad M. Tajwar, Md. Nuruddin Pathan, Latifa Hussaini, Adamu Abubakar, Journal of Information Processing Systems Vol. 13, No. 4, pp. 941-950, Aug. 2017
https://doi.org/10.3745/JIPS.01.0018
Keywords: Average Turnaround Time, Average Waiting Time, CPU Processing Time, Round Robin Algorithm, Quantum Time
Fulltext:
Abstract
Statistics
Show / Hide Statistics
Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
|
Cite this article
[APA Style]
Tajwar, M., Pathan, M., Hussaini, L., & Abubakar, A. (2017). CPU Scheduling with a Round Robin Algorithm Based on an Effective Time Slice. Journal of Information Processing Systems, 13(4), 941-950. DOI: 10.3745/JIPS.01.0018.
[IEEE Style]
M. M. Tajwar, M. N. Pathan, L. Hussaini, A. 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. 2017. 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.