recategorized by
2,845 views

4 Answers

Best answer
7 votes
7 votes
“Waiting time” is one of the metric for deciding the schedule of processes. If the OS tries to minimize the average waiting time of the processes it’ll follow the $\textsf{Shortest Remaining Time First}$ algorithm which though reduces the average waiting time of processes can still cause a long burst time process to $\textsf{starve.}$
selected by
5 votes
5 votes
Waiting time is high when a shorter process waits for a longer process to finish(as in FIFO), or a process waits because many shorter processes keep on coming(as in SJF). Overall, such a situation is undesirable.
2 votes
2 votes
For better perfrmance of the os waiting time should be less of a process.It is undesirable that a process waits to get chance for cpu.

Related questions

9 votes
9 votes
5 answers
1
go_editor asked Dec 18, 2016
4,351 views
State any undesirable characteristic of the following criteria for measuring performance of an operating system:Turn around time
14 votes
14 votes
3 answers
3
go_editor asked Dec 19, 2016
4,164 views
Given below is solution for the critical section problem of two processes $P_0$ and $P_1$ sharing the following variables:var flag :array [0..1] of boolean; (initially fa...
2 votes
2 votes
0 answers
4
go_editor asked Dec 18, 2016
671 views
A modern day machine typically has an atomic TEST AND SET instruction. Why?