Comparetine study for last improvements of Round Robin algorithm

الملخص

Due to the significant impact of the rotational scheduling algorithm in improving the utilization of the processor, this research focuses on the modern improved versions of this algorithm.

This paper deals with nine recent versions of Round Robin algorithm, including two versions about rotational scheduling in cloud computing.

A comparison is made between modern algorithms and their efficiency with traditional ones, and algorithms are tested on the same procedures (tested and implemented on procedures with different arrival times and different burst time) and the optimum algorithm was determined to work with the aim of improving utilization cpu by improving its basic parameters (AWT - NCS - ATT – ART).

Improving the main parameters of Cpu by reducing: (average waiting time (AWT) -number of context switches (NCS) - the average turnaround time (ATT)) and increase Throughput time.

The comparison took place in two stages:

1- A set of specific procedures (5 procedures) that have a different specific arrival time and a different specific burst time.

2- A set of (100 procedurals) with random latency and burst time the python codes for the proposed algorithms were written in the research, verified and showed the results.