Disk Scheduling

In multiprogrammed system, many processes try to read or write the records on disks at the same time. When the requests are made faster, they are serviced either by the moving-head disks, waiting lines or queues build up for each device. In some system, the requests are serviced by simple first-in-first...

Continue reading →

Round Robin Scheduling and Multilevel Queue Scheduling

Round Robin Scheduling In round robin scheduling processes are dispatched FIFO but are given a limited amount of CPU time called a time-slice or a quantum. If a process does not complete before its CPU time expires, the CPU is preempted and given to the next waiting process. The preempted process is...

Continue reading →