ZuoTi.Pro
Question

Suppose that a disk drive has 1000 cylinders, numbered 0 to 999. The drive is currently...

Suppose that a disk drive has 1000 cylinders, numbered 0 to 999. The drive is currently serving a request at cylinder 200, and the previous request was at cylinder 100. The queue of pending requests, in order, is 61, 270, 913, 774, 948, 422, 750, 509, 13 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests using the SSTF disk-scheduling algorithm?

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

Homework Answers

Answer #1

Answer:-----------

Given, The queue of pending requests, in order, is 61, 270, 913, 774, 948, 422, 750, 509, 13
Disk drive has 1000 cylinders, numbered 0 to 999.
Current head position = 200

Solution,

Selects the request with the least seek time from the current head position.

In other words, SSTF chooses the pending request closest to the current head position.

200, 270, 422, 509, 750, 774, 913, 948, 61,13

70+152+87+241+24+139+35+887+ 48 = 1683 cylinder.

0 0
Add a comment
Know the answer?
Add Answer to:
Suppose that a disk drive has 1000 cylinders, numbered 0 to 999. The drive is currently...
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

  • Suppose that a disk drive has 10,000 cylinders, numbered 0 to 10,000. The drive is currently...

    Suppose that a disk drive has 10,000 cylinders, numbered 0 to 10,000. The drive is currently serving a request at cylinder 7,423 and the previous request was at cylinder 8213. The queue of pending requests, in FIFO order, is: 9324, 6324, 7232, 1304, 5621, 105, 5382, 3241, 2425, 9891. 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?...

  • Suppose that a disk drive has 6,000 cylinders, numbered 0 to 5999. The drive is currently...

    Suppose that a disk drive has 6,000 cylinders, numbered 0 to 5999. The drive is currently serving a request at cylinder 3150, and the previous request was at cylinder 1805 (Hint: this indicates the reading head’s moving direction). The queue of pending requests, in FIFO order, is: 3511, 2332, 2800, 3192, 658, 1296, 1918, 1356, 5936, 2527 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending...

  • 1. Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is...

    1. 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,956 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...

  • 8.) [12 pts.] Suppose that a disk drive is currently serving a request at cylinder 1010,...

    8.) [12 pts.] Suppose that a disk drive is currently serving a request at cylinder 1010, the previous red cylinder 1000. The queue of pending requests, in FIFO order, is: drive has 2,000 cylinders, numbered O to 1,999. The 1010, 1310, 1950, 800, 200, 750, 1000 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisty all the pending requests for each of the following disk scheduling algorithms a.) FCFS...

  • Suppose a disk system has 200 cylinders, numbered 0 to 199. Assume that the read /...

    Suppose a disk system has 200 cylinders, numbered 0 to 199. Assume that the read / write head is at cylinder 63. Determine the order of head movement for each algorithm to satisfy the following stream of requests received in the following order: Queue:   100, 175, 51, 133, 8, 140, 73, 77 Head: 63 Draw head movement for Shortest Seek Time First (SSTF) algorithm. [1]

  • I need a full solution to this question. ( Operating Systems ) First Image: Second Image:...

    I need a full solution to this question. ( Operating Systems ) First Image: Second Image: Third Image: Fourth Image: thank you. Suppose that a disk has 5000 cylinders, numbered 0 to 1999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 152. The queue of pending requests is as follows: 130, 1750 1022, 1509, 948, 1774, 913, 1470, 86 Starting from the current head position, what is total "seek time" for...

  • Consider the following information: ✓ A disk drive with 200 cylinders, ✓ A request queue :...

    Consider the following information: ✓ A disk drive with 200 cylinders, ✓ A request queue : 98, 149, 37, 122, 14, 124, 65, 67 ✓ Head pointer 25. ✓ Direction: the disk arm is moving to innermost. Answer the following questions. (a) By using the C-LOOK disk scheduling algorithms, illustrates by drawing the movement of the disk arm to satisfy the requests. Label clearly. (b) Calculate the total distance (in cylinders) that the disk arm moves to satisfy the requests....

  • Write a  program that implements the following disk-scheduling algorithms: a. FCFS b. SSTF c. SCAN d. C-SCAN Your program will service a disk with 5,000 cylinders numbered 0 to 4,999. The program will...

    Write a  program that implements the following disk-scheduling algorithms: a. FCFS b. SSTF c. SCAN d. C-SCAN Your program will service a disk with 5,000 cylinders numbered 0 to 4,999. The program will be passed the initial position of the disk head (as a parameter on the command line) and report the total amount of head movement and total number of change of direction required by each algorithm under each of the following cases: a)The program will generate a random...

  • Disk requests come into the disk driver for cylinders 10, 22, 20, 2, 40, 6, and...

    Disk requests come into the disk driver for cylinders 10, 22, 20, 2, 40, 6, and 38, in that order. Assume that the disk has 100 cylinders numbered 0 through 99. The arm (head) is initially at cylinder 20. Based on the following disk scheduling algorithms, draw scheduling diagram indicating the movement of the head as arm (head) moves around the cylinders services the requests. i. (5 points) First Come First Served ii. (5 points) Shortest Seek Time First iii....

  • Write a java program that implements the following disk-scheduling algorithms: a. FCFS b. SSTF c. SCAN...

    Write a java program that implements the following disk-scheduling algorithms: a. FCFS b. SSTF c. SCAN Your program will service a disk with 5000 cylinders numbered 0 to 4999. The program will generate a random series of 1,000 cylinder requests and service them according to each of nth algorithms listed above. The program will be passed the initial position of the disk head and report the total amount of head movement required by the algorithm.

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
ADVERTISEMENT