Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently...

50.1K

Verified Solution

Question

General Management

Suppose that a disk drive has 5,000 cylinders, numbered 0 to4,999. The drive is currently serving a request at cylinder 2,150,and the previous request was at cylinder 1,805. The queue ofpending requests, in FIFO order, is:
2,069, 1,212, 2,296, 2,800, 544, 1,618, 356, 1,523, 4,965,3681
Starting from the current head position, what is the totaldistance (in cylinders) that the disk arm moves to satisfy all thepending requests for each of the following disk-schedulingalgorithms?
FCFS
SSTF
SCAN
LOOK
C-SCAN
C-LOOK

Answer & Explanation Solved by verified expert

3.7 Ratings (540 Votes)

Diskscheduling algorithms is anapproach used by operating system to plan the input and outputrequest for accessing the disk The purpose of it is to reduce thetotal seek timeThe time required to read or write the disc blockdetermined by three factorsSeek time Time tomove the section to the proper cylinderRotational delayThe time for a proper part to rotate under the headActual time of datatransferAs per the Given data the number ofcylinders are 5000 which is numbered from 0 to 4999The current head position ofcylinder See Answer

Get Answers to Unlimited Questions

Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!

Membership Benefits:

Unlimited Question Access with detailed Answers
Zin AI - 3 Million Words
10 Dall-E 3 Images
20 Plot Generations
Conversation with Dialogue Memory
No Ads, Ever!
Access to Our Best AI Platform: Flex AI - Your personal assistant for all your inquiries!

Become a Member