Abstract | ||
---|---|---|
Round Robin (RR) Scheduling is the basis of time sharing environment. It is the combination of First Come First Served (FCFS) scheduling algorithm and preemption among processes. It is basically used in a time sharing operating system. It switches from one process to another process in a time interval. The time interval or Time Quantum (TQ) is fixed for all available processes. So, the larger process suffers from Context Switches (CS). To increase efficiency, we have to select different TQ for processes. The main objective of RR is to reduce the CS, maximize the utilization of CPU and minimize the turn around and the waiting time. In this paper, we have considered different TQ for a group of processes. It reduces CS as well as enhancing the performance of RR algorithm. TQ can be calculated using min-max dispersion measure. Our experimental analysis shows that Group Based Time Quantum (GBTQ) RR algorithm performs better than existing RR algorithm with respect to Average Turn Around Time (ATAT), Average Waiting Time (AWT) and CS. |
Year | DOI | Venue |
---|---|---|
2014 | 10.5120/10667-5445 | International Journal of Computer Applications |
Field | DocType | Volume |
Quantum,First-come, first-served,Preemption,Scheduling (computing),Computer science,Computer network,Algorithm,Real-time computing,Turnaround time,Round-robin scheduling,Context switch,Time-sharing | Journal | abs/1403.0335 |
Issue | ISSN | Citations |
10 | International Journal of Computer Applications 2013 | 2 |
PageRank | References | Authors |
0.40 | 6 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sanjaya Kumar Panda | 1 | 47 | 12.46 |
Debasis Dash | 2 | 25 | 4.80 |
Jitendra Kumar Rout | 3 | 18 | 2.95 |