edited by
16,787 views
56 votes
56 votes

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 Served (FCFS). If FCFS is replaced by Shortest Seek Time First (SSTF), claimed by the vendor to give $50 \%$ better benchmark results, what is the expected improvement in the I/O performance of user programs?

  1. $50 \%$
  2. $40\%$
  3. $25\%$
  4. $0\%$
edited by

4 Answers

Best answer
92 votes
92 votes
Question says "single sequential user process". So, all the requests to disk scheduler will be in sequence and each one will be blocking the execution and hence there is no use of any disk scheduling algorithm. Any disk scheduling algorithm gives the same input sequence and hence the improvement will be $0\%$ for SSTF over FCFS.

Correct Answer: $D$
edited by
1 votes
1 votes
D) 0%

In a single-user environment, the I/O queue usually is empty. Requests generally arrive from a single process for one block or for a sequence of consecutive blocks. In these cases, FCFS is an economical method of disk scheduling since OS can execute a single sequential user process at a time, the disk is accessed in FCFS manner always. The OS never has a choice to pick an IO from multiple IOs as there is always one IO at a time.
1 votes
1 votes

 

  • From the statement  “capable of loading and executing a single sequential user process at a time”, its clear that only one request can be at the disk device queue. 
  • If there is just a single request at the device queue, then it doesn’t matter which disk scheduling we use (FCFS or SSTF). 
  • There is just a single request, and data transfer time is not dependent on FCFS or SSTF once we reach the right sector for reading a sector. The seek time and rotational time should be same for FCFS or SSTF for that single request, from the previous postion of the read/write head.



So, in this scenario, using SSTF algorithm, which gives 50% better results, will not improve any performance over FCFS algorithm.

Thus, option [D] is right.


Note that, whether FCFS or SSTF algorithm is to be used is OS design choice (as OS schedules the submitted requests to be served in some order as per the underlying disk scheduling algorithm), and time to read/write a sector is a hardware property (as it is based on rotation speed of disk device which can’t be changed)

0 votes
0 votes
The scheduling algorithms like FCFS,SSTF doesn't affect the I/O performance. Rather these are CPU scheduling algorithms hence affects the CPU performance and not the I/O performance.So the correct option would be (d)0%
edited by
Answer:

Related questions

40 votes
40 votes
6 answers
1
23 votes
23 votes
3 answers
3
Kathleen asked Sep 18, 2014
12,470 views
Consider the following set of processes, with the arrival times and the CPU-burst times gives in milliseconds.$$\small \begin{array}{|c|c|c|} \hline \textbf{Process} & \t...
66 votes
66 votes
9 answers
4
Kathleen asked Sep 18, 2014
23,663 views
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined bythe instruction set architecturepage sizenum...