Priority Round Robin with Dynamic Time Quantum : FPRRDQ

  • Proff. M. K. Srivastav, Sanjay Pandey, Indresh Gahoi, Neelesh Kumar Namdev
  • Published 2012

Abstract

Round Robin, considered as the most widely adopted CPU scheduling algorithm, undergoes severe problems directly related to quantum size. If time quantum chosen is too large, the response time of the processes is considered too high. On the other hand, if this quantum is too small, it increases the overhead of the CPU. Round Robin (RR) scheduling algorithm… (More)

5 Figures and Tables

Topics

  • Presentations referencing similar topics