Log In
4 votes

State any undesirable characteristic of the following criteria for measuring performance of an operating system:

Turn around time

in Operating System
recategorized by
What is the undesirable condition for waiting time????

5 Answers

4 votes
By the way the turnaround time should not be a metre to evalaute the performance of  an OS .

But here they ask so

Undesirable is that : (i) long burst process are running first and smaller run after long.
3 votes
turn around time does not take into account the length of the cpu burst of the given's efficient for a long process to finish last and for shorter process to finish first.

completion time for a process also includes the time taken to output the result to the output device which depends on the speed of output device. so turn around time and completion time are not a good criterian to measure the performance of operating system because they also depends on factors other than efficiency of OS.

edited by
1 vote
$\textsf{Turn around time} = \textsf{Waiting time}+\textsf{Burst time}$

Since, $\textsf{Burst time}$ is independent of the scheduling algorthm, to minimize the average turn around time, the OS scheduler has to minimize average the waiting time. This means resorting to $\textsf{Shortest Remaining Time First}$ scheduling which on the positive side gives the minimum average waiting time but on the negative side can cause long burst time processes to $\textsf{starve}.$
0 votes
A)for turn around time.....the undesirable characteristics is that, the burst time of the processes should not be long.

B) for waiting time.....the undesirable characteristics is that arrival time of the processes should not be same.
–1 vote
Turn around time should be less to get better performance.Undesirable condition occure when turnaround time is more.

Related questions

4 votes
4 answers
State any undesirable characteristic of the following criteria for measuring performance of an operating system: Waiting time
asked Dec 18, 2016 in Operating System jothee 1.5k views
4 votes
1 answer
Consider the DFA $M$ and NFA $M_{2}$ as defined below. Let the language accepted by machine $M$ be $L$. What language machine $M_{2}$ accepts, if $F2=A?$ $F2=B?$ $F2=C?$ $F2=D?$ $M=(Q, \Sigma, \delta, q_0, F)$ $M_{2}=(Q2, \Sigma, \delta_2, q_{00}, F2)$ ... $D=\{\langle p, q, r \rangle \mid p \in Q; q \in F\}$
asked Dec 20, 2016 in Theory of Computation jothee 429 views
1 vote
0 answers
Consider the following Ada program: Procedure P is BAD-FORMAT: exception Procedure Q is begin ... if S/='b' then raise BAD-FORMAT end if; ... end Q; Procedure R is begin Q; exception when BAD-Format => ... handler body 1 end R; begin R; Q; exception when BAD-FORMAT => ... handler body 2 end P; Under what conditions are the two handler bodies $1$ and $2$ executed?
asked Dec 19, 2016 in Programming jothee 195 views
1 vote
2 answers
Mark the balance factor of each on the tree given on the below figure and state whether it is height-balanced.
asked Dec 19, 2016 in DS jothee 799 views