C-SCAN Scheduling, Eschenbach Scheme and Rotational Optimization

C-SCAN Scheduling Disk arm moves unidirectionally across the disk surface toward the inner track. When there are no more requests for service ahead of the arm, it jumps back to service the request nearest the outer track and proceeds inward again. It eliminates the discrimination of earlier strategies...

Continue reading →

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 →