Dekker's algorithm

Dekker's algorithm

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

Dekker's algorithm is the first known correct solution to the mutual exclusion problem in concurrent programming where processes only communicate via shared memory. The solution was attributed to Dutch mathematician Th.

Excerpt from the Wikipedia article “Dekker's algorithm”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Dekker's algorithm to your collection.

Play for free

Related cards