Encyclopedia > Dekker's algorithm

  Article Content

Dekker's algorithm

Dekker's algorithm is a concurrent programming algorithm 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.

External links:

  

 



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
Reformed churches

... Church[?] (Dutch Reformed - GKN) One of the most conservative Reformed/Calvinist denominations in the world, the PRC separated from the CRC in the 1920s in a ...

 
 
 
This page was created in 25.9 ms