Optimal Round Robin CPU Scheduling Algorithm using Euclidean Distance
Merwyn D apos Souza, Fiona Caiero, Suwarna Surlakar · International Journal of Computer Applications · 2014
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.