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.
... abandoned.
Aldwych tube station
Blake Hall tube station[?]
British Museum tube station[?]
Brompton Road tube station[?]
City Road tube station[?]
Down Stree ...