GATE CSE 2004 | Question: 12

Question

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?

• A. $50 \%$
• B. $40\%$
• C. $25\%$
• D. $0\%$

Comments

Please help me to understand the question

---

@arjun sir if they mention in question multi user process at a time then what is answer how it improves the Io performances of user pgm

---

what is benchmark result?

Answer 1

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$

Comments

can anyone explain why they have mentioned “claimed by the vendor to give 50% better benchmark results”, when it is mentioned that there is 50% improvement then why are we not considering it

---

@Abhineet

Because benchmark and real world performance is different. In the real world we have single sequential user process system. The vendor might have some different benchmark.

---

A benchmark is a single program, so it can be assumed that the test has several random memory accesses. Also, “sequential user process” does not imply “sequential memory access” – a process can make random requests. Considering an equal number of CPU bound and IO bound processes in the real world by the user, it can be said that IO bound processes make several random reads, similar to the benchmark, and therefore see a 50% improvement, while CPU bound processes don’t see any improvement. So wouldn’t the overall improvement in IO be the average, i.e., 25%.

Answer 2

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.

Answer 3

 

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

Answer 4

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%