Recent questions tagged disk-scheduling

1 1 vote
1 1 answer
40
40 views
The designer of an operating system noticed, after performance measurements, that the system presented disk access problems, with a very high average waiting time. Select...
0 0 votes
1 1 answer
32
32 views
A magnetic-disk head is currently at cylinder : $100$Pending requests are:$120,\ 90,\ 70,\ 80,\ 140,\ 110,\ 60$The scheduling method follows these rules:requests may be r...
0 0 votes
2 2 answers
50
50 views
Which of the following statements about magnetic-disk arm scheduling is incorrect?FCFS handles requests according to arrival order and is considered fair, although it gen...
0 0 votes
1 1 answer
27
27 views
Consider the following statement:If disk requests are scheduled using SSTF, the seek time will increase compared with FCFS. Furthermore, the elevator algorithm is not rec...
0 0 votes
1 1 answer
42
42 views
A disk has $200$ tracks numbered $0$ through $199$.The disk head is currently at track $:184$Disk requests arrive for:$184,\ 187,\ 176,\ 182,\ 199$If SSTF scheduling is u...
0 0 votes
1 1 answer
35
35 views
Suppose a disk repeatedly services requests for one particular track while requests for other tracks remain unserved. This phenomenon is called disk-arm sticking.Which of...
0 0 votes
1 1 answer
42
42 views
Which disk scheduling algorithm selects the pending request requiring the smallest movement of the disk arm from its current position, thereby choosing the minimum seek t...
3 3 votes
1 1 answer
160
160 views
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...
1 1 vote
1 1 answer
249
249 views
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...
0 0 votes
1 1 answer
521
521 views
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 ...
0 0 votes
1 1 answer
427
427 views
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...
0 0 votes
1 1 answer
400
400 views
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 ...
1 1 vote
1 1 answer
440
440 views
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 ...
0 0 votes
1 1 answer
408
408 views
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...
0 0 votes
0 0 answers
324
324 views
Consider the following Graph of disk scheduling and identify the disk scheduling algorithm representing by this graph.Queue $84, 125, 11, 36, 170, 20, 172, 45$$\text{SSTF...
0 0 votes
1 1 answer
385
385 views
Match List - I with List - II.$\begin{array}{|ll|ll|} \hline & \textbf{List - I} && \textbf{List-II} \\ & \textbf{(operating system concepts)} && \textbf{(characteristics...
0 0 votes
0 0 answers
277
277 views
The head of a moving head disk with $200$ tracks, numbered $0$ to $199$, has just finished a request at track $125$, and currently serving a request at track $143$. The q...
1 1 vote
2 answers 2 answers
551
551 views
C12. Consider the following information about a magnetic hard disk, with cylinders numbered 0 (innermost) to 511 (outermost):at time \(t = 0\) ms, the disk head is at cyl...
2 2 votes
2 2 answers
361
361 views
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...
5 5 votes
1 1 answer
1.2k
1.2k views
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...
0 0 votes
1 1 answer
7.6k
7.6k views
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
0 0 votes
1 1 answer
673
673 views
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...
0 0 votes
1 1 answer
697
697 views
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...