Consider a disk that is scheduled using a variant of the Elevator policy. In this policy, the disk head scans from the first cylinder to the last repeatedly, processing I/O requests along the way. Note that as the disk head completes a scan and reaches the last cylinder, it moves back to the first cylinder (without processing any requests) and starts the next scan. Also, each scan is terminated whenever there are no I/O requests in the disk queue at higher-numbered cylinders (with respect to the cylinder the disk head is in), but there are I/O requests in the disk queue in lower-numbered cylinders. In such a case, the head moves back to the lowest-numbered cylinder among the requests in the disk queue. Finally, note that if there are no pending I/O requests, the disk head does not move and waits for new requests to arrive before it resumes scanning.