Improving Efficiency of Round Robin Scheduling Using Ascending Quantum and Minumim-Maxumum Burst Time

Round robin (rr) is a kind of process algorithms, where the time quantum is fixed along the processes execution. in the other hand it depending on the first come first serve (fcfs) algorithm. also rr performs in timesharing system by given each process static time quantum (tq). in this paper, the tq studied to improve the efficiency of rr and performs the degrades with respect to context switching (cs), average wait time (awt) and average turned around time (atat) that an overhead on the system. thus, the new approach was proposed to calculate the tq, known as ascending quantum and minumim- maxumum round robin (aqmmrr). the processes were ascending with shortest remaining burst time and calculate the tq from multiply the summation of minimum and maximum bt by (80) percentage. the experimental result shows that aqmmrr performs better than rr and comparing with other two related works.