Dekker's Algorithm in Hindi for Critical Section Problem Solution
41 هزار بار بازدید -
4 سال پیش
-
OS Notes @100 UPI ID
OS Notes @100 UPI ID LK9001@ICICI Share screenshot on 7417557883
automata Notes @100 UPI ID LK9001@ICICI Share screenshot on 7417557883
Dekker’s algorithm was the first provably-correct solution to the critical section problem. It allows two threads to share a single-use resource without conflict, using only shared memory for communication. It avoids the strict alternation of a naïve turn-taking algorithm, and was one of the first mutual exclusion algorithms to be invented.
4 سال پیش
در تاریخ 1399/01/17 منتشر شده
است.
41,046
بـار بازدید شده