Anonymous user menu

Concurrent Processes and shared boolean variables

explain

4Comments
Sameer Dubey @sameerz567
12 Nov 2014 01:03 am

In this question the bounded waiting is not satisfied suppose initially s1=0 and s2=1 the as per the program, p2 may enter, execute within the cs and come out now suppose S1 doesn't have to enter again and if s2 wants to enter again then because s1 is not entering then s2 can also not enter and there is no upper bound as to how much s2 should wait, in short the entry of s2 is determined by s1 which the primary condition that dissatisfies bounded waiting

also, Mutual exclusion is easily ensured in the given program

 

 

Vivek Vikram Singh @vivek14
12 Nov 2014 01:16 pm

I hope you have studied the Strict Alteration. This Strict alteration concept is very important in Process sync concept and essential for all other good problems like this. Actually this problem is Strict alteration only. Please go through the strict alteration topic in Mutual Exclusion. I am providing links to it.

http://www.moreprocess.com/process-2/mutual-exclusion-by-strict-alternation

http://www.personal.kent.edu/~rmuhamma/OpSystems/Myos/achieveutualExclu.htm

If still you dont get it, Please reply here. I wil be explaining that.

 

Sameer Dubey @sameerz567
12 Nov 2014 02:28 pm

Actually this problem is solely based on Decker's algorithm which explains the strict alteration

Sameer Dubey @sameerz567
13 Nov 2014 12:08 pm

it is by mistake i wrote bounded waiting, its actually progress that is not satisfied