This topic is in Operating System: Mass-Storage Structure

I only need an explanation for part a.). The answer for part a.) is Shortest Seek Time First (SSTF), but I need an explanation. Please provide an explanation for why SSTF is a good scheduling algorithm for this case. Thanks!

Requests are not usually uniformly distributed. For example, we can expect a cylinder containing the file-system metadata to be accessed more frequently than a cylinder containing only files. Suppose you know that 50 percent of the requests are for a small, fixed number of cylinders. a) Would any of the scheduling algorithms discussed in the class be particularly good for this case? Explain your answer. b) Propose a disk-scheduling algorithm that gives even better performance by taking advantage of this "hot spot" on the disk