For our example request queue, the closest request to the initial head
position (53) is at cylinder 65. Once we are at cylinder 65, the next closest
request is at cylinder 67. From there, the request at cylinder 37 is closer than the
one at so 37 is served next. Continuing, we service the request at cylinder 14,
then 124, and finally 183 (Figure 12.5). This scheduling method results
in a total head movement of only 236 more than of
the distance needed for FCFS scheduling of this request queue. This algorithm
gives a substantial improvement in performance