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

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

3 Answers

0 votes
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

Related questions

0 votes
0 votes
1 answer
1
N3314nch41 asked Sep 10, 2023
360 views
How to approach synchronization (specifically semaphore) question, there size are really intimidating and i’m unable to decode the code written? What to do??
0 votes
0 votes
2 answers
2
shivajikobardan asked Jul 22, 2023
800 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...