Disk Scheduling
Among the times Seek time is the most critical. Average access time can be improved by reducing the average Seek Time.
Assumption: A queue of requests for each IO device is maintained. At any time a number of requests from various processes are in the queue. Consider a sequence of n-requests for scheduling.
Example: Tracks: 55, 58, 39, 18, 90, 160, 150, 38
Using FIFO, SSTF, SCAN, C-SCAN. Table 11.3, Fig.11.7