Recent questions tagged disk-scheduling

A disk contains tracks numbered from $0$ through $199$.The disk head is currently at track $184$.The pending requests, in arrival-list order, are $184, 187, 176, 182, 199...

In a magnetic surface memory, an 8 KB file is stored in the consecutive sectors in the same track. Let each sector capacity be 0.25 KB and the file starting sector number...

Consider the following disc Queue with requests for I/O to block on cylinders:$45,81,185,33,175,99,150,77$(Consider that the head starts from location $58$)What shall be ...

Consider the following disc Queue with requests for I/O to block on cylinders:$45,81,185,33,175,99,150,77$(Consider that the head starts from location $58$)What will be t...

Consider the following disc Queue with requests for I/O to block on cylinders:$45,81,185,33,175,99,150,77$(Consider that the head starts from location $58$)What shall be ...

Consider the following disc Queue with requests for I/O to block on cylinders:$45,81,185,33,175,99,150,77$(Consider that the head starts from location $58$)What shall be ...

Consider the following disc Queue with requests for I/O to block on cylinders :$ 45,81,185,33,175,99,150,77$(Consider that the head starts from location $58$)What shall b...

Match List - I with List - II.$\begin{array}{|ll|ll|} \hline & \textbf{List - I} && \textbf{List-II} \\ & \textbf{(operating system concepts)} && \textbf{(characteristics...

Consider the following requests to read data from cylinders of a hard drive, where the current position of the head is at cylinder $73$ and the head is moving towards cyl...

At a particular point in time, the buffer cache has dirty data that needs to be flushed to disk. Suppose that the identities of these blocks can be listed in [track:secto...

Find seek time using FCFS,SSTF, SCAN.C-SCAN, LOOK for the following string98, 183, 37, 122, 14, 124, 65, 67Assume that request queue (0-199).and Head pointer 53

Consider a disk system with cylinders. The request to access the cylinders occurs in the following sequence:\[4,34,10,7,19,73,2,15,6,20\]Assuming that the head is current...

Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is first come first serv...

If the disk head is initially located at track $32,$ find the number of disk moves required with First Come First Serve $\text{(FCFS)}$ scheduling criteria if the disk qu...