HomeworkLib
Question

II. Answer the following questions relating to O Maaeent and Disk Sceduling: (a) Assume the FCFS disk scbeduling algorithm is used when tracks on a disk need to be accessed as in the following queue: 120, 55, 58, 39, 18, 90, 160, 150, 38, 184. You have to sbow how the tracks will be accessed when using the C-SCAN disk scheduling algorithm Assume that the disk arm always starts at track 100 and that no other track requests arrive during the given queue of disk track access requests. / (b) Prove that, according to this example in a), the C-SCAN algorithm is more efficient than the FCFS algorithm Show all your steps. /

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

FCFS 149 RS し20 6S 30 4b 1CD So 38 18 41 (120-t00)+(120-5 (585)-3)+(3-12)4 (40- ) (l-1o) (160-1s0)(15-3) + C1gy-30)538 track C - SCan 25 So 0 too 90 1 28 2 ley 120 S6 Croo -)+(-+ (1-120) Scan t more ebbcient than fCFS C-scan Uceb elevato~ -plgorithm.t+Scans. trly in ne direction attes,升voft 1° next- Completion dire ch on

0 0
Add a comment
Know the answer?
Add Answer to:
II. Answer the following questions relating to O Maaeent and Disk Sceduling: (a) Assume the FCFS...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • The following sequence of disk access requests have been received by the computer systems. The numbers...

    The following sequence of disk access requests have been received by the computer systems. The numbers are the track numbers. Numbering starts at 0 (the centremost track on the disk). 24, 68, 3, 17, 57, 49, 91, 121 Determine the actual average seek length for this particular series of accesses based on each of the following algorithms. Assume the read head starts at track 48. Find... i. Shortest seek first (move the fewest number of tracks to the next entry)...

  • I/O Scheduling Algorithms a) For each of the following scheduling algorithms, give a 1-2 sentence description...

    I/O Scheduling Algorithms a) For each of the following scheduling algorithms, give a 1-2 sentence description of how it works. The description should be precise enough to distinguish each algorithm from the others. Algorithms: FCFS, SSTF, SCAN, C-SCAN, C-LOOK. (1 point) b) Given a hard disk with 200 cylinders and a queue with jobs having the following cylinder requests: 80, 190, 70, 130, 30, draw a diagram of the movements of the head for each of the algorithms listed in...

  • Please help me with 6 questions in 2 pictures below! The question is very clear. Please...

    Please help me with 6 questions in 2 pictures below! The question is very clear. Please help me is the Of the three components of access time in a movable-head Disk Arm Scheduling Algorithms, longest. Select one: a. delay time b. seek time c. transfer time d. search time DMA can operate in mode Select one: a. Word-at-time, Fly-by, Block mode b. Word-at-time, response, Block mode O c. Word-at-time, Fly-by, request d. Word-at-time, Fly-by The requirements for long-term information storage...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT