Aspire Faculty ID #18617 · Topic: UGC NET Computer Science Dec 2022 Shift II (Paper II) · Just now
UGC NET Computer Science Dec 2022 Shift II (Paper II)

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$ and the vendor claims $50%$ better benchmark results. What is the expected improvement in the I/O performance of user programs?

Solution

The system can execute only one sequential user process at a time.

So, at any time, there will be only one active I/O request from the user process.

Disk scheduling algorithms like $FCFS$ and $SSTF$ are useful when there are multiple pending disk requests.

Here, there is no queue of multiple requests to reorder.

Therefore, $SSTF$ cannot provide any real improvement over $FCFS$ for user programs in this case.

Expected improvement:

$0%$

Previous 10 Questions — UGC NET Computer Science Dec 2022 Shift II (Paper II)

Nearest first

Next 10 Questions — UGC NET Computer Science Dec 2022 Shift II (Paper II)

Ascending by ID
1
For the following set of processes scheduled using FCFS policy, determine the average waiting time. Assume that the pro…
Topic: UGC NET Computer Science Dec 2022 Shift II (Paper II)
2
Which of the following is not a Non-functional requirement?
Topic: UGC NET Computer Science Dec 2022 Shift II (Paper II)
3
Topic: Software Engineering → Software Cost Estimation COCOMO stands for-
Topic: UGC NET Computer Science Dec 2022 Shift II (Paper II)
4
Modifying the software to match changes in the ever-changing environment is called as
Topic: UGC NET Computer Science Dec 2022 Shift II (Paper II)
5
For a function of two variables, boundary value analysis yields,
Topic: UGC NET Computer Science Dec 2022 Shift II (Paper II)
6
How many different binary trees are possible with $n$ nodes?
Topic: UGC NET Computer Science Dec 2022 Shift II (Paper II)
7
Let $n$ denote a positive integer. Suppose a function $F$ is defined as $f(n)= \begin{cases} 0, & n=1 \ f\left(\lef…
Topic: UGC NET Computer Science Dec 2022 Shift II (Paper II)
8
Given the FFT we can have ______ time procedure for multiplying two polynomials $A(x)$ and $B(x)$ of degree bound $n$ w…
Topic: UGC NET Computer Science Dec 2022 Shift II (Paper II)
9
Consider the Graph below: How many spanning trees can be found? 
Topic: UGC NET Computer Science Dec 2022 Shift II (Paper II)
10
The transition function $\delta$ in multi-tape Turing machine is defined as:
Topic: UGC NET Computer Science Dec 2022 Shift II (Paper II)
Ask Your Question or Put Your Review.

loading...