Question: Q.4)(10pts) Assume, an operating system serves non uniformly distributed disk requests. (For example: directory structures may reside on the outermost cylinders and accessed more frequently

Q.4)(10pts) Assume, an operating system serves non uniformly distributed disk requests. (For example: directory structures may reside on the outermost cylinders and accessed more frequently than the files.) Suppose, it is also known that, 50% of the disk requests are for a small fixed number of cylinders. If you were the OS designer, which disk scheduling algorithm(s) would you prefer and why? Give sufficient details with examples.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!