In FCFS, we process the requests in the order they arrive, without regard to the current position of the heads.
The shortest-seek-time-first (SSTF) disk-scheduling algorithm moves the heads the minimum amount it can to satisfy any pending request.
Suffers from starvation
A disk system has 100 cylinders, numbered 0 to 99. Assume that the read / write head is at cylinder 50 and determine the order of head movement for each algorithm to satisfy the following stream of requests. For comparison purposes, calculate the total head travel distance. They are listed in the order received.
40, 12, 22, 66, 67, 33, 80, 75, 85, 65, 8