Winners
| Year | Paper | Topic |
|---|---|---|
| 2000 | Lamport, L. (1978). "Time, clocks, and the ordering of events in a distributed system". Communications of the ACM 21 (7): 558–565. doi:10.1145/359545.359563. http://research.microsoft.com/users/lamport/pubs/time-clocks.pdf. edit | Lamport logical clock |
| 2001 | Fischer, M. J.; Lynch, N. A.; Paterson, M. S. (1985). "Impossibility of distributed consensus with one faulty process". Journal of the ACM 32 (2): 374–382. doi:10.1145/3149.214121. http://theory.lcs.mit.edu/tds/papers/Lynch/jacm85.pdf. edit | Proving the impossibility of consensus using asynchronous communication |
| 2002 | Dijkstra, E. W. (November 1974). "Self-stabilizing systems in spite of distributed control". Communications of the ACM 17 (11): 643-644. doi:10.1145/361179.361202. edit | Self-stabilization |
| 2003 | Herlihy, M. (1991). "Wait-free synchronization". ACM Transactions on Programming Languages and Systems 13 (1): 124–149. doi:10.1145/114005.102808. edit Maurice Herlihy | Solvability and universality of consensus in shared-memory systems |
| 2004 | Gallager, R. G.; Humblet, P. A.; Spira, P. M. (1983). "A Distributed Algorithm for Minimum-Weight Spanning Trees". ACM Transactions on Programming Languages and Systems 5 (1): 66–77. doi:10.1145/357195.357200. edit | Distributed algorithm to find a minimum spanning tree |
| 2005 | Pease, M.; Shostak, R.; Lamport, L. (April 1980). "Reaching Agreement in the Presence of Faults". Journal of the ACM 27 (2): 228–234. doi:10.1145/322186.322188. edit | Byzantine agreement |
| 2006 | Mellor-Crummey, J. M.; Scott, M. L. (1991). "Algorithms for scalable synchronization on shared-memory multiprocessors". ACM Transactions on Computer Systems 9 (1): 21–65. doi:10.1145/103727.103729. edit | "probably the most influential practical mutual exclusion algorithm of all time" |
| 2007 | Dwork, C.; Lynch, N.; Stockmeyer, L. (1988). "Consensus in the presence of partial synchrony". Journal of the ACM 35 (2): 288–323. doi:10.1145/42282.42283. edit | Solving consensus in partially synchronous systems |
| 2008 | Awerbuch, B.; Peleg, D. (1990). "Sparse partitions". Proceedings 31st Annual Symposium on Foundations of Computer Science. pp. 503–513. doi:10.1109/FSCS.1990.89571. ISBN 0-8186-2082-X. edit | Sparse partitions |
| 2009 | Halpern, J. Y.; Moses, Y. (1990). "Knowledge and Common Knowledge in a Distributed Environment". Journal of the ACM 37 (3): 549–587. doi:10.1145/79147.79161. edit | A formal framework for reasoning about knowledge in distributed systems |
| 2010 | Chandra, T. D.; Toueg, S. (1996). "Unreliable Failure Detectors for Reliable Distributed Systems". Journal of the ACM 43 (2): 225-267. doi:10.1145/226643.226647. edit Chandra, T. D.; Hadzilacos, V.; Toueg, S. (1996). "The Weakest Failure Detector for Solving Consensus". Journal of the ACM 43 (4): 685-722. doi:10.1145/234533.234549. edit |
Failure detectors |
| 2011 | Attiya, H.; Bar-Noy, A.; Dolev, D. (1995). "Sharing Memory Robustly in Message-Passing Systems". Journal of the ACM 42 (1): 124-142. doi:10.1145/200836.200869. edit | Simulating shared memory in fault-prone message-passing systems |
| 2012 | Herlihy, M.; Moss, J. E. B. (1993). "Transactional memory". ACM SIGARCH Computer Architecture News 21 (2): 289-300. doi:10.1145/173682.165164. edit Shavit, N.; Touitou, D. (1997). "Software transactional memory". Distributed Computing 10 (2): 99. doi:10.1007/s004460050028. edit |
Transactional memory |
Read more about this topic: Dijkstra Prize
Famous quotes containing the word winners:
“The two real political parties in America are the Winners and the Losers. The people don’t acknowledge this. They claim membership in two imaginary parties, the Republicans and the Democrats, instead.”
—Kurt Vonnegut, Jr. (b. 1922)