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)
ii. Circular Scan (towards the outside of the disk first, direction of increasing track number)
iii. LOOK algorithm (towards the outside of the disk first, direction of increasing track number)
We need at least 10 more requests to produce the answer.
0 / 10 have requested this problem solution
The more requests, the faster the answer.
The following sequence of disk access requests have been received by the computer systems. The numbers...
Some request lists might cause the disk scheduler to act the same when the three different algorithms are run. Create a request list of five track numbers that will cause all three algorithms to visit the same tracks in the same order. Enter those five track numbers here. If shortest seek time first starts with the disk head positioned at either 0 or 99, instead of at 50 (in the middle), which algorithm would it resemble: FCFS or SCAN? Why?
(c) Assume that . accessing and searching the TLB takes 5 ns, . transferring the data from the TLB into a register takes 10 ns, . updating a record in the TLB takes 15 ns, .accessing and searching the PT takes 50 ns, .transferring the data from the PT into a register takes 70 ns, . the TLB hit ratio is 0.6. How many nanoseconds are needed on average to perform all the TLB and PT operations needed to compute...