retagged by
5,184 views
3 3 votes
What is Lock Variable solution to critical section problem?

Does it satisfy all the conditions like Mutual exclusion, Bounded waiting and Progress?

3 Answers

0 0 votes

Peterson and Dekker's algo, both solves :

ME, BW and progress these three conditions.

Also progress is satisfied so deadlock is not possible ( bcoz progress done in finite time where as deadlock is infinite waiting).

Reference :

  1. https://cs.stackexchange.com/questions/12621/contrasting-peterson-s-and-dekker-s-algorithms ( see 2nd answer , the table)
  2. https://cs.stackexchange.com/questions/60235/is-bounded-waiting-ensured-in-given-version-of-dekkers-solution-for-critical-se
edited by
Position:
Show:

Related questions

3 3 votes
1 1 answer
261
261 views
GO Classes asked Jul 25
261 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...
3 3 votes
1 1 answer
100
100 views
GO Classes asked Aug 29
100 views
For a correct mechanism controlling entry into a critical section, consider the following requirements:Two processes must not execute simultaneously inside their critical...
0 0 votes
0 0 answers
283
283 views
Vishnu__ asked Feb 4
283 views
The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows:void enter_CS(x) { while (test-a...
0 0 votes
1 1 answer
355
355 views
Shubham Sharma 2 asked Sep 9, 2025
355 views
Which of the following statements are CORRECT ?A process always check state of currently executing process to enter critical schema.Spin locks uses busy waiting.Periodica...