A Dynamic Time Quantum SJRR CPU Scheduling Algorithm

Provided by: Allied Journals
Topic: Hardware
Format: PDF
CPU scheduling is a vital discipline which helps the authors gain deep insight into the complex set of policies and mechanisms used to govern the order in which tasks are executed by the processor. This paper proposes a dynamic time quantum shortest job round robin CPU scheduling algorithm having better Average Waiting Time (AWT) and Average Turn-around Time (ATT) as compared to other CPU scheduling techniques. The primary objective of this algorithm is to optimize system performance according to the criteria deemed most important by system designers.

Find By Topic