期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2014
卷号：5
期号：6
页码：7210-7217
出版社：TechScience Publications
摘要：Round Robin (RR), one of the oldest CPU scheduling algorithms has found its importance in time sharing systems. In an ideal RR an equal quantum time is allocated to each process residing in the ready queue. A process which is assigned a CPU may run to completion if and only if its quantum time is greater than its CPU burst. Otherwise, after the process exhausted its quantum time the process must be preempted to take turn in the next round. Some major challenges in classical RR are: poor response time, unnecessary context switching and poor multiprogramming. Using Half Life Variable Quantum Time Round Robin (HLVQTRR), variable quantum time is used to eliminate those challenges. All dataset used for the evaluation are generated using normal distribution function
关键词：Round Robin (RR); turnaround time; waiting;time; context switching (CS); quantum time (QT).
