269 views
3 3 votes

Which of the following statements are correct?

  1. Mutual exclusion ensures that if one process is executing in its critical section, no other process can execute in its critical section.
     
  2. A process executing in its remainder section may participate in deciding which waiting process enters the critical section next.
     
  3. Bounded waiting requires a limit on the number of times other processes may enter their critical sections after a process requests entry and before its request is granted.
     
  4. A correct solution may assume that one process always executes faster than the other processes.

1 Answer

3 3 votes

Statement (A) is correct.

Mutual exclusion allows at most one process to execute in its critical section at a time.

Statement (B) is incorrect.

Under the progress requirement, only processes interested in entering the critical section may participate in deciding which process enters next.

Statement (C) is correct.

Bounded waiting requires a finite bound on the number of times other processes may enter before a waiting process receives permission.

Statement (D) is incorrect.

A correct critical-section solution must not depend on assumptions about the relative execution speeds of processes.

Answer:
Position:
Show:

Related questions

4 4 votes
1 1 answer
241
241 views
GO Classes asked Jul 27
241 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...
2 2 votes
1 1 answer
192
192 views
GO Classes asked Jul 27
192 views
Consider the following solution for process $P_i$:$\texttt{while (turn != i);}$$\texttt{Critical Section}$$\texttt{turn = j;}$Which of the following statements are correc...
4 4 votes
1 1 answer
249
249 views
GO Classes asked Jul 27
249 views
Two processes $P_i$ and $P_j$ use Peterson’s solution:$\texttt{flag[i] = TRUE;}$$\texttt{turn = j;}$$\texttt{while(flag[j] \&\& turn == j);}$$\texttt{Critical Section}$$\...
3 3 votes
1 1 answer
293
293 views
GO Classes asked Jul 25
293 views
Consider the following entry and exit code used by two processes:$\texttt{while(lock);}$$\texttt{lock = TRUE;}$$\texttt{Critical Section}$$\texttt{lock = FALSE;}$Initiall...