Disk Scheduling Algorithms - an Interactive Example

Enter ten values, each within the range of 1 to 200, representing head position requests to be serviced by a disk scheduling algorithm.If you do not enter values, or enter values outside of the specified range, then random values will be generated for you.

Then, select one of the four disk scheduling algorithims shown, to see how the system fulfills the request.

Block 1: Block 2: Block 3: Block 4: Block 5:
Block 6: Block 7: Block 8: Block 9: Block 10:
First Come First Serve Shortest Seek Time First SCAN CSCAN
INITIAL DIRECTION OF MOTION OF HEAD: LEFT RIGHT
(Initial direction of motion only matters for SCAN and CSCAN, of course.)
INITIAL HEAD POSITION:
"LOOK"-MODE: