An Effective Round Robin Algorithm using Min-Max Dispersion Measure

• DOI: 10.48550/arxiv.1404.5869
• Publication Date: 2014-01-01
• Authors: Sanjaya Kumar Panda; Sourav Kumar Bhoi
• Keywords: FOS: Computer and information sciences; Computer Science - Operating Systems; Operating Systems (cs.OS); 0202 electrical engineering, electronic engineering, information engineering; 02 engineering and technology

Round Robin (RR) scheduling algorithm is a preemptive algorithm. It designed especially for time sharing Operating System (OS). In RR the CPU switches between processes when static Time Quantum (TQ) expires. considered as most widely used in research because TQ equally shared among processes. this paper newly proposed variant of called Min-Max (MMRR) presented. The idea MMRR to make repeatedly adjusted using dispersion measure accordance with remaining burst time. Our experimental analysis shows that performs much better than terms average turnaround time, waiting and number context switches.