OPERATING SYSTEMS 3 Requests are not usually uniformly distr

OPERATING SYSTEMS

3. Requests are not usually uniformly distributed. For example, a cylinder containing the file system FAT or inodes can be expected to be accessed more frequently than a cylinder that only contains files. Suppose you know that 50 percent of the requests are for a small, fixed number of cylinders.

Propose a disk-scheduling algorithm (one that we have discussed) that gives even better performance by taking advantage of this “hot spot” on the disk. Explain your answer and discuss any problems and how you might mitigate them.

Solution

Here is my idea... keep the hot data near to disk middle so that by modofying SSTF will prevent starvation.
For betterment place/add the policy if the disk at in idle more than 50ms. Then OS will generate anticipatory seek to
the placed hot region since next request will be placed at disk.