The Edsger W. Dijkstra Prize in Distributed Computing is named for Edsger Wybe Dijkstra (1930-2002), a pioneer in the area of distributed computing. His foundational work on concurrency primitives (such as the semaphore), concurrency problems (such as mutual exclusion and deadlock), reasoning about concurrent systems, and self-stabilization comprises one of the most important supports upon which the field of distributed computing is built. No other individual has had a larger influence on research in principles of distributed computing. The prize is awarded for outstanding papers on the principles of distributed computing, whose significance and impact on the theory or practice of distributed computing have been evident for at least a decade. It is sponsored jointly by the ACM Symposium on Principles of Distributed Computing (PODC) and the EATCS Symposium on Distributed Computing (DISC). The prize is presented annually, with the presentation taking place alternately at PODC and DISC.
The committee decided to award the 2022 Edsger W. Dijkstra Prize in Distributed Computing to the papers
Maged M. Michael.
Safe Memory Reclamation for Dynamic Lock-Free Objects Using Atomic Reads and Writes.
Proc. of the 22nd ACM Symp. on Principles of Distributed Computing (PODC), pages 21–30, 2002.
and
Maurice Herlihy, Victor Luchangco, and Mark Moir.
The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures. Proc. of the 16th Intl. Symp. on Distributed Computing (DISC), pages 339–353, 2002.
for providing the first general approach to memory reclamation in nonblocking data structures, with significant impact both in research and practice.
Award Committee 2022:
- Marcos Aguilera, VMware Research
- Alessandro Panconesi, University of Rome La Sapienza
- Andrea Richa, Arizona State University
- Christian Scheideler (Chair), Paderborn University
- Alexander Schwarzmann, Augusta University
- Philipp Woelfel, University of Calgary
