Abstract
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. General Terms Operating Systems, Algorithms, Efficiency.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
