Recent questions tagged mutual-exclusion

4 4 votes
1 1 answer
233
233 views
Two processes use the following symmetric solution:For process $P_i$:$\texttt{flag[i] = TRUE;}$$\texttt{while (flag[j]);}$$\texttt{Critical Section}$$\texttt{flag[i] = FA...
3 3 votes
1 1 answer
261
261 views
Which of the following statements are correct?Mutual exclusion ensures that if one process is executing in its critical section, no other process can execute in its criti...
0 0 votes
1 1 answer
496
496 views
Which of the following statements are TRUE about mutual exclusion in concurrent programming?Mutual exclusion ensures that only one process can be in a critical section at...
0 0 votes
0 0 answers
263
263 views
Check for mutual exclusion , progress and bounded wait. while (x 0); x++; // Critical Section (CS) x ;
0 0 votes
0 0 answers
183
183 views
Consider an operating system consisting of a pair of processes $P_{0}$ and $P_{1}$. The structure of each process $P_{\mathrm{i}}$ is shown below.while(TRUE){ j = 1-i; fl...
0 0 votes
1 1 answer
465
465 views
14. Lets there are many processes. To implement mutual exclusion following code is used. do{key=TRUE;while (key==TRUE)swap (lock, key);lock=FALSE;} while(1); Which of...
0 0 votes
2 2 answers
2.2k
2.2k views
Sorry if this is a stupid question. But it really intrigued me. Same resources at different algorithms are telling different ways to test these stuffs.Here's an algorith...
12 12 votes
2 2 answers
2.0k
2.0k views
We want to use semaphores to implement a shared critical section (CS) among three threads $\text{T1, T2},$ and $\text{T3}.$ We want to enforce the execution in the CS in ...
1 1 vote
2 2 answers
1.6k
1.6k views
If the P() and V() semaphore operations are not executed atomically, then which of the following are always correct?Mutual exclusion satisfied Progress is not satisfiedBo...
5 5 votes
4 4 answers
9.4k
9.4k views
The hardware implementation which provides mutual exclusion isSemaphoresTest and set instructionsBoth optionsNone of the options
0 0 votes
0 0 answers
595
595 views
Consider the following solution to the mutual-exclusion problem involving two processes $P0$ and $P1$. Assume that the variable turn is initialized to $0$. Process $P0’s$...
1 1 vote
1 1 answer
1.4k
1.4k views
0 0 votes
1 1 answer
1.4k
1.4k views
Please tell me that why BW is satisfied here I m facing problem in these topic
0 0 votes
0 0 answers
3.0k
3.0k views
Many problems on gateoverflow asks whether the given code satisfies progress requirement of the solution for the critical section problem. Most of these code contain mult...
1 1 vote
1 1 answer
3.4k
3.4k views
Consider the followingProcess Piwhile(1){ while(turn != i); //critical section turn = j; //remainder section}Process Pjwhile(1){ while(turn != j); //critical ...
0 0 votes
1 1 answer
456
456 views
Mutual exclusion problem occursbetween two disjoint processes that do not interactamong processes that share resourcesamong processes that do not use the same resource No...
1 1 vote
1 1 answer
576
576 views
Please describe the procedure to solve such problems where we have to find deadlock,exclusion,inclusion,progress.
0 0 votes
0 0 answers
1.7k
1.7k views
I understand the Question Correctly. i know Mutual Exclusion ,But Can Anyone explain What is MUTUAL INCLUSION, ??
1 1 vote
0 0 answers
676
676 views
1 1 vote
0 0 answers
283
283 views
3 3 votes
3 3 answers
4.4k
4.4k views
Consider program for P1 and P2:Here, m and n are binary semaphore variables whose values are initially initialized to 1. x and y are shared resources whose values are in...
2 2 votes
0 0 answers
1.5k
1.5k views
6 6 votes
3 answers 3 answers
8.1k
8.1k views
Mutual exclusion problem occursbetween two disjoint processes that do not interactamong processes that share resourcesamong processes that do not use the same resourcebet...
1 1 vote
1 1 answer
2.4k
2.4k views
Consider the methods used by processes $P_1$ and $P_2$ for accessing their critical sections. The initial values of shared Boolean variables $S_1$ and $S_2$ are randomly...
To see more, click for the full list of questions or popular tags.