Dekker's algorithm is a concurrent programmingalgorithm for mutual exclusion that allows two processes to share a single-use resource without conflict, using only shared memory for communication.
It avoids the strict alternation of a naive turn-taking algorithm, and was one of the first mutual exclusion algorithms to be invented.
... whole. In the great division of the Hegelian school, he, in company with Michelet and others, formed the "centre," midway between Erdmann and Gabler on the one hand, and the ...