Results 1 - 2 of about 2 sawaal for " dekkers solution"
This is the first correct solution proposed for the two-process case. Originally developed by Dekker in a different context, it was applied to the critical section problem by Dijkstra.Both the turn of the behaviors of the active objects, as indicated in the automatons dynamic model The synchronizations are fired according...well, Dekkers Solution to Mutual Exclusion is the first correct solution proposed
Posted in
Computers & Technology by saurabh at 4:07 AM on October 03, 2008
of the shared data structure, the so-called "critical region". This prevents interrupt code from running in the critical region. Beside this hardware supported solution, some software solutions exist that use "busy-wait" to achieve the goal. Examples of these algorithms include: Dekkers algorithm Petersons algorithm Lamports bakery algorithmIn a computer in which several processors share memory
Posted in
Computers & Technology by Belaphadke at 1:37 AM on November 07, 2008
