567 views

1 Answer

0 0 votes

Many examples could be given but to find intuition about it, one is enough.

Consider this GATE Question : https://gateoverflow.in/1256/gate2007-58

In this Code, Deadlock is Possible and thus Starvation is Possible But Bounded Waiting is Satisfied. 

Informally Speaking, Bounded waiting is defined in the terms of "Number of times" whereas Deadlock or Starvation is defined in the terms of "time".

Position:
Show:

Related questions

3 3 votes
2 answers 2 answers
2.6k
2.6k views
NIKU asked Oct 26, 2017
2,579 views
Consider the below Algorithm where flag and lock are global variables:P0: P1:while (fla...
0 0 votes
1 1 answer
1.0k
1.0k views
rakeshgsharma asked Aug 23, 2017
1,036 views
Struct Semaphore{ int value; Queue type L;} Down (Semaphore S){ S.value = S.value -1; if(S.value<0) { pu...
0 0 votes
0 0 answers
190
190 views
tarunmundriya asked Dec 27, 2025
190 views
Consider a system consisting of processes P1, P2, ..., Pn, each of which has a unique priority number. Write a monitor that allocates three identical printers to these pr...
0 0 votes
0 0 answers
562
562 views
Redlex69 asked Jan 7, 2025
562 views
Caption@Sachin Mittal 1 @DEEPAK_POONIA