search
Log In
0 votes
90 views

in Operating System 90 views
1
A higher burst time process can face this issue in Shortest remaining time first scheduling while a very low priority process can face this issue in priority scheduling.
0
But it is possible in both situation . If a stream of shortest job arrived then long burst will wait indefinetly . same for priority  scheduling.
0
what about FCFS?

didn't it cause indefinite Blocking?

1 Answer

2 votes
SRTF and Priority scheduling both may lead to indefinite blocking.

In the case of SRTF, jobs with longer BT may wait forever, and in case of priority scheduling, the low priority job may never get a chance to execute.
0
yeah ... but the answer given is D. I think B  should also be correct .
0
@Manisha why not FIFO as if a process with large burst time if arrived first than it can block the other process with lower burst time

 

And what is mean by indefinite block here ?
0
In FIFO if a process is arriving early it is getting chance at least to stand in queue, while in case of Priority /SRTF no matter who arrived first who is waiting from time 0.
0
Indefinite block means we cant say, when the process get CPU . In SRTF/priority process get blocked unrelated to their Arrival time  . but in FIFO we can calculated a fixed time after that a particular process get executed .
1
In FIFO when a process arrived its waiting time is fixed . That means how long it have to wait is defined as soon as it arrives . But in SRTF / priority their is uncertainity .

Related questions

0 votes
2 answers
1
110 views asked Aug 20, 2018 in Operating System Smishra95 110 views
0 votes
0 answers
2
68 views
while(1) { flag[i]=true; while(flag[j]); <cs> flag[i]=false; } someone please tell bounded wait is satisfying or not???
asked Dec 12, 2017 in Operating System aaru14 68 views
0 votes
1 answer
3
38 views
Which one of the following is a key factor for preferring $B$-trees to binary search trees for indexing database relations? Database relations have a large number of records Database relations are sorted on the primary key $B$-trees require less memory than binary search trees Data transfer from disks is in blocks
asked Mar 30 in Databases Lakshman Patel RJIT 38 views
0 votes
2 answers
4
82 views
If following sequence of keys are inserted in a $B+$ tree with $K(=3)$ pointers: $8,5,1,7,3,12,9,6$ Which of the following shall be correct $B+$ tree?
asked Mar 24 in Databases jothee 82 views
...