Open AccessAn advanced approach to traditional round robin CPU scheduling algorithm to prioritize processes with residual burst time nearest to the specified time quantum
Author(s) -
Mythili N. Swaraj Pati,
Pranav Korde,
Pallav Dey
Publication year - 2017
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/263/4/042001
Subject(s) - turnaround time , computer science , context switch , scheduling (production processes) , algorithm , response time , time complexity , execution time , least slack time scheduling , parallel computing , round robin scheduling , dynamic priority scheduling , mathematical optimization , computer network , mathematics , quality of service , embedded system , operating system