deadlock

What Is Dekker’s Algorithm In Operating System With Example?

by

What Is Dekker’s Algorithm In Operating System With Example? 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. What is Dekker’s solution? Dekker’s algorithm is the first known correct solution to the mutual exclusion problem

Is Strict 2pl Deadlock Free?

by

Is Strict 2pl Deadlock Free? Conservative 2PL is deadlock free,but Strict 2PL can have deadlock. Is Conservative 2PL deadlock free? Conservative 2-PL – A.K.A Static 2-PL, this protocol requires the transaction to lock all the items it access before the Transaction begins execution by predeclaring its read-set and write-set. … Conservative 2-PL is Deadlock free