Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending 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 total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk- scheduling algorithms? c. SCAN d. LOOK

Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending 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 total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk- scheduling algorithms? c. SCAN d. LOOK

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter8: Advanced Data Handling Concepts

Section: Chapter Questions

Problem 20RQ

See similar textbooks

Similar questions

Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is: 2,069; 1,212; 2,296; 2,800; 544; 1,618; 356; 1,523; 4,965; 3,681 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. SCAN c. C-SCAN d. LOOK e. C-LOOK
Suppose that a disk drive has 6,000 cylinders, numbered 0 to 5,999. The drive is currently serving a request at cylinder 3,250, and the previous request was at cylinder 4,805. The queue of pending requests, in FIFO order, is:1515, 1212, 1296, 3800, 544, 618, 356, 2523, 5965, 4681Starting from the current head position, what is the total distance (in cylinders) that thedisk arm moves to satisfy all the pending requests for each of the following diskscheduling algorithms?a. FCFSb. SSTFc. SCANd. LOOK
ng Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,100, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is: 2,069; 1,212; 2,296; 2,800; 544; 1,618; 356; 1,523; 4,965; 3,681 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- C-SCAN (the head by default goes to the higher cylinder first.)
Suppose that a disk drive has 7,000 cylinders, numbered 0 to 6,999. The drive is currently serving a request at cylinder 1,958, and the previous request was at cylinder 1,807. The queue of pending 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 total distance (in cylinders) that the disk arm moves to satisfy all the pending requests with First Come First Serverd(FCFS) alogrithim?
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 133, and the previous request was at cylinder 115. The queue of pending requests, in FIFO order, is:76,1460, 903, 1764, 938, 1499, 1012,1740,120. 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
A disk drive has 24 cylinders (0-23). Initially, the head points to cylinder 8 (moving towards cylinder 0). For C-SCAN and C-LOOK, requests are serviced while the head is moving from inner cylinder (0) to outer cylinder (23). You must count also the cylinders when the head is moving without servicing. The following requests are in the queue (where the requests arrival is from left to right): 11 - 3- 17 - 4 - 10 - 12 - 8 - 9 - 22 - 13. What is the total head movements using the following scheduling algorithms: a) FCFS: b) C-SCAN: c) SSTF: d) C-LOOK:
Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a requestat cylinder 20 (the previous request served was at cylinder 19) when the last of these requests is madewith none of these requests yet served. The queue of pending requests, in FIFO order, is 5, 25, 18, 3,39, 8, and 35. A seek takes 5ms per cylinder movement. Starting from the current head position, whatis the total distance (in cylinders) that the disk arm moves to satisfy all the pending request and alsocalculate the total seek time needed to serve these requests, for each of the following disk-schedulingalgorithms? Explain with the help of a diagram in each case. a. FCFSb. SSTFc. SCANd. LOOK
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending 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 total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk- scheduling algorithms? e. C-SCAN f. C-LOOK
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending 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 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
Please solve the question for the last two parts. Thanks in advance.
Suppose that a disk drive has 6,000 cylinders, numbered 0 to 5999. The drive is currently serving a request at cylinder 2225, and the previous request was at cylinder 5195 (Hint: this indicates the reading head’s moving direction). The queue of pending requests, in FIFO order, is: 5962,2876,5452,1369,3594,5046,866,3269,409,1744 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 SSTF SCAN LOOK C-SCAN C-LOOK
5. Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a request at cylinder 20 (the previous request served was at cylinder 19) when the last of these requests is made with none of these requests yet served. The queue of pending requests, in FIFO order, is 5, 25, 18, 3, 39, 8, and 35. A seek takes 5ms per cylinder movement. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending request and also calculate the total seek time needed to these requests, for each of the following disk-sc ling algorithms? Explain with the help of a diagram in each case. [2X4] a. FCFS b. SSTF c. SCAN d. LOOK