Theodorus Jozef Dekker, known as Dirk Dekker, was a Dutch mathematician who lived from 1 March 1927 to 25 November 2021. He completed his doctorate at the University of Amsterdam in 1958 with a thesis titled Paradoxical Decompositions of Sets and Spaces. In computing he is remembered for Dekker's algorithm, which lets two processes share a single-use resource without conflict while communicating only through shared memory. The algorithm is regarded as the first known correct solution to the mutual exclusion problem in concurrent programming, and Edsger Dijkstra attributed it to him in an unpublished paper on sequential process descriptions and in his manuscript on cooperating sequential processes.
Facts
Connections
Credited
Source Dekker's algorithm (Wikipedia)
In Field
Source Theodorus Dekker (Wikipedia)
Invented By
Source Theodorus Dekker (Wikipedia)
In the Other Atlases
Nationality
Also in Geography Atlas: the nationality of this subject.
Source Theodorus Dekker (Wikipedia)Lead [nationality]Quote, Lead [nationality]
was a Dutch mathematician
Sources
1. Theodorus Dekker (Wikipedia)
Lead [birth-year]
Theodorus Jozef Dekker (Dirk Dekker, 1 March 1927
Lead [nationality]
was a Dutch mathematician
In Field: Algorithms and Complexity Theory, Lead
Dekker invented an algorithm that allows two processes to share a single-use resource without conflict
In Group: Algorithm Design and Analysis, Lead
Dekker invented an algorithm that allows two processes to share a single-use resource without conflict
Invented By: Dekker's algorithm, Lead
Dekker invented an algorithm that allows two processes to share a single-use resource without conflict
View the SourceDekker's algorithm (Wikipedia)
Credited: Dekker's algorithm, LeadQuote, Credited: Dekker's algorithm, Lead
The solution was attributed to Dutch mathematician Th. J. Dekker by Edsger W. Dijkstra
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.