343 views
2 votes
2 votes

Let m[0]....m[4] be mutexes (binary semaphores) and P[0].......P[4] be processes. 
Suppose each process P[i] executes the following:

     wait (m[i]; wait (m(i+1) mode 4]);
     ........... 
     release (m[i]); release (m(i+1) mod 4]);

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
1
hem chandra joshi asked Jan 1, 2018
210 views
https://gateoverflow.in/?qa=blob&qa_blobid=11484316347737079122Reference this question https://gateoverflow.in/1314/gate2009-28can any one tell how this matrix obtain .?
0 votes
0 votes
0 answers
2
hem chandra joshi asked Oct 25, 2017
241 views
The bipartite graph G = (V ,E) with bipartition (V1, V2) has a complete matching from V1 to V2 if and only if |N(A)| ≥ |A| for all subsetsA of V1.
1 votes
1 votes
1 answer
3
0 votes
0 votes
0 answers
4