International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 96 - Number 18 |
Year of Publication: 2014 |
Authors: Merwyn D’souza, Fiona Caiero, Suwarna Surlakar |
10.5120/16892-6930 |
Merwyn D’souza, Fiona Caiero, Suwarna Surlakar . Optimal Round Robin CPU Scheduling Algorithm using Euclidean Distance. International Journal of Computer Applications. 96, 18 ( June 2014), 8-11. DOI=10.5120/16892-6930
The performance of Round robin CPU scheduling algorithm is entirely dependent on the time quantum selected. This paper describes a new method to calculate the time quantum without user intervention by finding the relationship between the burst times of all processes in the ready queue using a similarity measure known as the Euclidean distance. Similarity measure is used to find patterns in the burst times of processes present in the ready queue.