Computers and Technology, 07.11.2019 22:31, leshia39
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. the drive is currently serving a request at cylinder 2150, and the previous request was at cylinder 1805. the queue of pending requests, in fifo order, is:
2069, 1212, 2296, 2800, 544, 1618, 356, 1523, 4965, 3681
starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms?
a. fcfs
b. sstf
c. scan
d. look
e. c-scan
f. c-look
Answers: 2
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. the drive is currently serving a...
Social Studies, 28.07.2019 15:40
Biology, 28.07.2019 15:40
Mathematics, 28.07.2019 15:40
History, 28.07.2019 15:40
Mathematics, 28.07.2019 15:40
History, 28.07.2019 15:40