Cambridge & Boston Await You!

Dijkstra Prize 2010

The 2010 Edsger W. Dijkstra Prize in Distributed Computing

The 2010 Edsger W. Dijkstra Prize in Distributed Computing



The ACM-EATCS Edsger W. Dijkstra Prize in Distributed Computing was created to acknowledge 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.

The annual award is sponsored jointly by the ACM Symposium on Principles of Distributed Computing (PODC) and the EATCS Symposium on Distributed Computing (DISC).

The Dijkstra Award Committee has selected Tushar D. Chandra, Vassos Hadzilacos, and Sam Toueg, to receive the 2010 Edsger W. Dijkstra Prize in Distributed Computing for the following two outstanding papers:

Tushar D. Chandra and Sam Toueg. Unreliable Failure Detectors for Reliable Distributed Systems, Journal of the ACM, 43(2):225-267, 1996. (The first version appearing in the Proceedings of the 10th ACM Symposium on Principles of Distributed Computing, 1991.)

Tushar D. Chandra, Vassos Hadzilacos and Sam Toueg. The Weakest Failure Detector for Solving Consensus, Journal of the ACM, 43(4):685-722, 1996. (The first version appearing in the Proceedings of the 11th ACM Symposium on Principles of Distributed Computing, 1992.)

The official citation is written by Marcos K. Aguilera and Michel Raynal.

2010 Dijkstra Prize in Distributed Computing Award Committee:
Name Affiliation
Nancy Lynch MIT, USA
Alexander Shvartsman U. of Connecticut, USA
James Anderson U. of North Carolina, USA
James Aspnes Yale University, USA
Pierre Fraigniaud CNRS, U. of Paris Sud, France
Rachid Guerraoui EPFL, Switzerland
Maurice Herlihy Brown University, USA