Question

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.

-Calculate the total head movement for SSTF algorithm

-Draw head movement for SCAN algorithm. *The disk arm is moving downward

-Calculate the total head movement for SCAN algorithm

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Hi,

i am glad to help you with this question.

This question consists of four parts . The question contains following information.

Queue:   100, 175, 51, 133, 8, 140, 73, 77
Head: 63

First part ) we have to draw the sstf algorithm head movements.

In Shortest Seek Time First (SSTF) algorithm, the request which is the closest to the current head position is serviced first .

IN the image as shown follows sstf algorithm as per that the current head position is at 63.

so the head moves to 73 as the distance from 63 to 73(i.e 10) is less than the distance from 63 to 51(i.e 12) therefore the head moves to 73 first then to 77 and so on .i have attached an image to show the head movements .

Second part ) this part needs all the head movements in sstf algorithm.

this has all the head movements of the queue.

the image attached shows the total head movements i.e sum of all the head movements .

The total head movements is 279.

Third part) This part heads the execution of the jobs using scan algorithm.

According to the scan algorithm , the head moves in one direction which the nearest to down and gives services and then to the opposite direction .when it moves in the opposite direction service is given to the jobs which have not received the service before.

The image attached shows the head movements , the head moves to zero because it is closest to the down and services all the jobs in the path and then moves towards 175 and serves the jobs in between the path.

Fourth part) this part needs the total head movements of the scan algorithm. which the sum of head movements .

The total head movements is 238.

Thank you.

I hope i was able to help you .If you any queries please be comfortable to ask in the comments i will be happy to help.

:) .

Add a comment
Know the answer?
Add Answer to:
Suppose a disk system has 200 cylinders, numbered 0 to 199. Assume that the read /...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

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 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]

  • 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...

  • 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?

  • 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 2150, and the previous request was at cylinder 1105. The queue of pending requests, in FIFO order, is: 2629, 3722, 2805, 3192,773, 1939, 1296, 1918, 5730, 2152, 1356 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...

  • 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....

  • 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...

  • 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...

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