SSTF

Consider the following five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a given time. (P, 155), (Q, 85), (R, 110)...

Consider a storage disk with $$4$$ platters (numbered as $$0, 1, 2$$ and $$3$$), $$200$$ cylinders (numbered as $$0, 1,$$ … , $$199$$), and $$256$$ sectors per track (numbered as $...

Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is given: 45, 20, 90, 10, 50, 60, 80, 25, 70. Assume that the initial position of the R/W hea...

Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at cylinder 100, and there is a queue of disk access requests for cylinders 30, 85, 90, 100,...

Consider a disk system with $$100$$ cylinders. The requests to access the cylinders occur in following sequence: $$4, 34, 10, 7, 19, 73, 2, 15, 6, 20$$ Assuming that the head is cu...

Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is First Come First Served $$(FCFS...

Which of the following disk scheduling strategies is likely to give the best throughput?

The head of a moving head disk with $$100$$ tracks numbered $$0$$ to $$99$$ is currently serving a request at tract $$55.$$ If the queue of requests kept in $$FIFO$$ order is $$10,...

Assuming the current disk cylinder to be $$50$$ and the sequence for the cylinders to be $$1, 36, 49, 65, 53, 1, 2, 3, 20, 55, 16, 65$$ and $$78$$ find the sequences of servicing u...

Disk requests come to disk driver for cylinders $$10,22,20,2,40,56$$ and $$38,$$ in that order at a time when the disk drive is reading from cylinder $$20.$$ The seek time is $$6ms...