Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation
Round Robin scheduling algorithm is the most widely used scheduling algorithm because of its simplicity and fairness [1]. However it has higher context switching, larger response time, larger waiting time, larger turnaround time, and lower throughput. Reference [1] proposed a new algorithm, called N...
Saved in:
Main Authors: | Chang, Jan Voon, Ahmad, Idawaty |
---|---|
Format: | Article |
Language: | English |
Published: |
Research and Publication Unit, University of Asia Pacific
2016
|
Online Access: | http://psasir.upm.edu.my/id/eprint/54512/1/Implementation%20of%20New%20Improved%20Round%20Robin.pdf http://psasir.upm.edu.my/id/eprint/54512/ https://www.ijcit.com/Vol5Issue6.php |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation
by: Chang, Jan Voon
Published: (2015) -
CPU scheduling with a round Robin algorithm based on an effective time slice
by: Tajwar, Mohammad M., et al.
Published: (2017) -
CPU Thread Prioritization Using a Dynamic Quantum Time Round-Robin Algorithm
by: Mohammed, Maysoon A., et al.
Published: (2016) -
Comparative study of Diffserv schedulers : Round Robin & Weighted Interleaved Round Robin
by: Norazuana Abu Bakar
Published: (2023) -
Queueing Theory Study of Round Robin Versus Priority Dynamic Quantum Time Round Robin Scheduling Algorithms
by: Maysoon, A. Mohammed, et al.
Published: (2015)