1,179 views
0 0 votes

LOAD Ri,M[LOCK]

CMP Ri,#0

JNZ TO STEP 1

STORE M[LOCK],#1

CRITICAL SECTION

STORE M[LOCK],#0

 

progress and bound wait satisfying or not??

1 Answer

1 1 vote
Mutual exclusion is not satisfied here, Progress is satisfied here and Bounded waiting is not satisfied.

Bounded waiting is not satisfied because there is problem of starvation suppose there are three processes P0,P1 and P2.

P0 successfully set the lock variable and executed the critical section now one process from waiting list P1 acquired the lock and executed but now in waiting list there are two process P2 and P0 but there is chance that P0 can again acquired lock before acquired by P2 and this can happen infinite time by which P2 will be starve. So Bounded waiting is not satisfied.

See Mutual exclusion and progress are two primary requirement of synchronization.  To solve above problem test and set solution was introduced but that also doesn't satisfy bounded waiting.
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
558
558 views
S Ram asked Jan 5, 2017
558 views
https://gradeup.co/synchronization-i-aa88478c-bb42-11e5-a5c3-3a0910926b62here in this artical the algorithm 2 which is flag solution for Critical solution problem satisfi...
3 3 votes
4 4 answers
2.2k
2.2k views
agoh asked Dec 11, 2016
2,172 views
My doubt is as follows: If deadlock is there, processes will be busy waiting in wait loop. So, decision on which process enters C.S. is not made in finite time. Hence, is...
0 0 votes
0 0 answers
471
471 views
Aboveallplayer asked Jan 18, 2016
471 views
i am unable to understand the concept of progress and bounded waiting after many reads of galvin.... i knw the basic but how to say looking at a code that progress is sat...
0 0 votes
1 1 answer
1.4k
1.4k views
gourav94240 asked Jun 9, 2019
1,351 views
Consider a network topology using STOP and WAIT protocol A -R B (here R is STORE and FORWARD ROUTER) Tp=1uS , Tx(data)=1000uS, Tx(ack)=10uS File Size =10000bits, ...