Question: (d) (e) Suppose that the head of a moving-head disk with 100 tracks, numbered 0 to 99, is currently serving a request at track

(d) (e) Suppose that the head of a moving-head disk with 100

(d) (e) Suppose that the head of a moving-head disk with 100 tracks, numbered 0 to 99, is currently serving a request at track 40 and moving upwards. The queue of requests is kept in a FIFO queue as the following. 80, 30, 55, 20, 10, 90 Calculate the total number of head movements (in terms of tracks traversed) needed to satisfy these requests for the following disk-scheduling algorithms. Illustrate the head movement either graphically or other means. (i) (ii) (iii) FCFS scheduling SCAN scheduling SSTF scheduling [6] Large scale data science computation platforms are built on distributed systems. There are many good features of distributed computer systems. Failure transparency and migration transparency are two of them. Explain why these two features are useful for scientific computation platforms. [2]

Step by Step Solution

3.49 Rating (156 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

d FCFS 80 30 55 20 10 90 Total head movements 240 tracks SCAN 40 80 90 99 0 10 20 30 55 Total head movements 317 tracks SSTF 40 30 20 10 55 80 90 Total head movements 200 tracks e Failure transparency ... View full answer

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 Programming Questions!