Question

Question From Operating System: Assume that disk requests are in the disk queue as indicated below....

Question From Operating System:

Assume that disk requests are in the disk queue as indicated below. Assume further that the R/W head begins each simulation with a starting position of track 50 (for C-SCAN you may assume it is moving right). Draw a picture indicating the head-travel using FCFS, SSTF and C-SCAN algorithms presented lgorithms .

WAITING REQUESTS (front) 11, 95, 20, 86, 5, 75, 85, 2, 100, 56, 47, 97 (rear)

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

WAITING REQUESTS (front) 11, 95, 20, 86, 5, 75, 85, 2, 100, 56, 47, 97 (rear)

1. First Come -First Serve (FCFS)

47 60 5 FCFS

2. Shortest Seek Time First (SSTF)

6 2. 475D 5‘ 1585 86ウre? 100 SSTF

3. Circular Scan (C-SCAN)

17 50 S CSCAN

Add a comment
Know the answer?
Add Answer to:
Question From Operating System: Assume that disk requests are in the disk queue as indicated below....
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
  • 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...

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

  • ------------------------------------------------------------------------------------------------------------ CODE ALREADY HAVE BELOW--------------------------------------------------------------------------------------- public class LinkedQueue<T>

    ------------------------------------------------------------------------------------------------------------ CODE ALREADY HAVE BELOW--------------------------------------------------------------------------------------- public class LinkedQueue<T> implements QueueADT<T> {    private int count;    private LinearNode<T> head;    private LinearNode<T> tail;               public LinkedQueue()    {        count = 0;        head = null;        tail = null;    }    @Override    public void enqueue(T element)    {        LinearNode<T> node = new LinearNode<T> (element);        if(isEmpty())            head = node;        else           ...

  • Solve it for java Question Remember: You will need to read this assignment many times to...

    Solve it for java Question Remember: You will need to read this assignment many times to understand all the details of the you need to write. program Goal: The purp0se of this assignment is to write a Java program that models an elevator, where the elevator itself is a stack of people on the elevator and people wait in queues on each floor to get on the elevator. Scenario: A hospital in a block of old buildings has a nearly-antique...

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