Dijkstra Prize

From Wikipedia, the free encyclopedia

The Edsger W. Dijkstra Paper Prize in Distributed Computing is given for outstanding papers on the principles of distributed computing, whose significance and impact on the theory and/or practice of distributed computing has been evident for at least a decade. The paper prize has been presented annually since 2000.

Originally the paper prize was presented at the ACM Symposium on Principles of Distributed Computing (PODC), and it was known as the PODC Influential-Paper Award. It was renamed in honor of Edsger W. Dijkstra in 2003, after he received the award for his work in self-stabilization in 2002 and died shortly thereafter.

Since 2007,[1] the paper prize is sponsored jointly by PODC and the EATCS International Symposium on Distributed Computing (DISC), and the presentation takes place alternately at PODC (even years) and DISC (odd years). The paper prize includes an award of $2000.

Winners[]

Year Paper Topic
2000[2] Lamport, L. (1978). "Time, clocks, and the ordering of events in a distributed system" (PDF). Communications of the ACM . 21 (7): 558–565. doi:10.1145/359545.359563. logical clocks
2001[3] Fischer, M. J.; Lynch, N. A.; Paterson, M. S. (1985). "Impossibility of distributed consensus with one faulty process" (PDF). Journal of the ACM. 32 (2): 374–382. doi:10.1145/3149.214121. Archived from the original (PDF) on 2007-07-05. Proving the impossibility of consensus using asynchronous communication
2002[4] 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. Self-stabilization
2003[5] Herlihy, M. (1991). "Wait-free synchronization". ACM Transactions on Programming Languages and Systems. 13 (1): 124–149. CiteSeerX 10.1.1.56.5659. doi:10.1145/114005.102808. Maurice Herlihy Solvability and universality of consensus in shared-memory systems
2004[6] 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. Distributed algorithm to find a minimum spanning tree
2005[7] ; Shostak, R.; Lamport, L. (April 1980). "Reaching Agreement in the Presence of Faults". Journal of the ACM. 27 (2): 228–234. CiteSeerX 10.1.1.68.4044. doi:10.1145/322186.322188. Byzantine agreement
2006[8] 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. CiteSeerX 10.1.1.228.3461. doi:10.1145/103727.103729. "probably the most influential practical mutual exclusion algorithm of all time"
2007[9] Dwork, C.; Lynch, N.; Stockmeyer, L. (1988). "Consensus in the presence of partial synchrony". Journal of the ACM. 35 (2): 288–323. CiteSeerX 10.1.1.13.3423. doi:10.1145/42282.42283. Solving consensus in partially synchronous systems
2008[10] Awerbuch, B.; Peleg, D. (1990). "Sparse partitions". Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science. pp. 503–513. doi:10.1109/FSCS.1990.89571. ISBN 978-0-8186-2082-9.
2009[11] Halpern, J. Y.; Moses, Y. (1990). "Knowledge and Common Knowledge in a Distributed Environment". Journal of the ACM. 37 (3): 549–587. arXiv:cs/0006009. doi:10.1145/79147.79161. A formal framework for reasoning about knowledge in distributed systems
2010[12] Chandra, T. D.; Toueg, S. (1996). "Unreliable Failure Detectors for Reliable Distributed Systems". Journal of the ACM. 43 (2): 225–267. CiteSeerX 10.1.1.113.498. doi:10.1145/226643.226647. hdl:1813/7192.
Chandra, T. D.; Hadzilacos, V.; Toueg, S. (1996). "The Weakest Failure Detector for Solving Consensus". Journal of the ACM. 43 (4): 685–722. CiteSeerX 10.1.1.55.8585. doi:10.1145/234533.234549. hdl:1813/6208. 		Failure detectors
2011[13] 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. Simulating shared memory in fault-prone message-passing systems
2012[14] Herlihy, M.; Moss, J. E. B. (1993). "Transactional memory". ACM SIGARCH Computer Architecture News. 21 (2): 289–300. doi:10.1145/173682.165164.
Shavit, N.; Touitou, D. (1997). "Software transactional memory". Distributed Computing. 10 (2): 99–116. CiteSeerX 10.1.1.468.7173. doi:10.1007/s004460050028. 		Transactional memory
2013[15] Linial, N. (1992). "Locality in Distributed Graph Algorithms". SIAM Journal on Computing. 21: 193–201. CiteSeerX 10.1.1.711.689. doi:10.1137/0221015. Locality in distributed graph algorithms
2014[16] Chandy, K. M.; Lamport, L. (1985). "Distributed snapshots: Determining global states of distributed systems". ACM Transactions on Computer Systems. 3: 63–75. CiteSeerX 10.1.1.69.2561. doi:10.1145/214451.214456. The Chandy–Lamport algorithm to get a consistent picture of the global state of a system
2015[17] (1983). "Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols". Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing - PODC '83. pp. 27–30. doi:10.1145/800221.806707. ISBN 978-0897911108.
Rabin, M. O. (1983). "Randomized byzantine generals". 24th Annual Symposium on Foundations of Computer Science (FOCS 1983). pp. 403–409. doi:10.1109/SFCS.1983.48. ISBN 978-0-8186-0508-6. 		Fault-tolerant randomized distributed algorithms
2016[18] Alon, Noga; Babai, László; (1986). "A fast and simple randomized parallel algorithm for the maximal independent set problem". Journal of Algorithms. 7 (4): 567. doi:10.1016/0196-6774(86)90019-2.
Luby, Michael (1986). "A Simple Parallel Algorithm for the Maximal Independent Set Problem". SIAM Journal on Computing. 15 (4): 1036–1053. CiteSeerX 10.1.1.225.5475. doi:10.1137/0215074. 		Algorithms for finding a maximal independent set
2017[19] ; (1993). "Generalized FLP impossibility result for t-resilient asynchronous computations". P 25th Annual ACM Symposium on Theory of Computing. ACM. pp. 91–100. The BG Simulation Algorithm, which allows a set of processes to simulate a larger set of processes in a coordinated way
2018[20] ; Schneider, Fred B. (1985). "Defining liveness". Information Processing Letters. 21 (4): 181–185. Formal definition of liveness property.
2019[21][22] ; (1997). "Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds". SIAM Journal on Computing. 26 (2): 350–368. doi:10.1137/S0097539793250767. hdl:1813/6127. Distributed edge coloring
2020[23] Angluin, D.; Aspnes, J.; ; Fischer, M. J.; (2006). "Computation in networks of passively mobile finite-state sensors". Distributed Computing. 18 (4): 235–253. doi:10.1007/s00446-005-0138-3.

Funding[]

The award is financed by ACM PODC and EATCS DISC, each providing an equal share of $1,000 towards the $2,000 of the award.

  • The PODC share is financed by an endowment at ACM that is based on gifts from the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), the ACM Special Interest Group on Operating Systems (SIGOPS), the AT&T Corporation, the Hewlett-Packard Company, the International Business Machines (IBM) Corporation, the Intel Corporation, and Sun Microsystems, Inc.
  • The DISC share is financed by an endowment at EATCS that is based on contributions from several year's DISC budgets, and gifts from Microsoft Research, the Universidad Rey Juan Carlos and the Spanish Ministry of Science and Innovation.

See also[]

References[]

  1. ^ Hendler, Danny (Jan 25, 2005). "Edsger W. Dijkstra Prize in Distributed Computing: Early call for paper nominations". Archived from the original on 2010-06-24.
    –"Call for Nominations: 2006 Edsger W. Dijkstra Prize in Distributed Computing – PODC Influential Paper Award". 25th Annual ACM SIGACT-SIGOPS Symposium on Principles Of Distributed Computing (PODC 2006) July 23-26, 2006, Denver, Colorado, USA.
    –Andrzej Pelc (ed.). Distributed Computing. 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007. doi:10.1007/978-3-540-75142-7.
    –"Dijkstra Prize 2007". www2.cs.ucy.ac.cy.
  2. ^ "2000 PODC Influential Paper Award", ACM Symposium on Principles of Distributed Computing, retrieved 2020-09-10
  3. ^ "2001 PODC Influential Paper Award", ACM Symposium on Principles of Distributed Computing, retrieved 2020-09-10
  4. ^ "2002 PODC Influential Paper Award", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
  5. ^ "Edsger W. Dijkstra Prize in Distributed Computing: 2003", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24
  6. ^ "Edsger W. Dijkstra Prize in Distributed Computing: 2004", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24
  7. ^ "Edsger W. Dijkstra Prize in Distributed Computing: 2005", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24
  8. ^ "Edsger W. Dijkstra Prize in Distributed Computing: 2006", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24
  9. ^ "Edsger W. Dijkstra Prize in Distributed Computing: 2007", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24
  10. ^ "Edsger W. Dijkstra Prize in Distributed Computing: 2008", ACM Symposium on Principles of Distributed Computing, retrieved 2009-08-24
  11. ^ "2009 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
  12. ^ "2010 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
  13. ^ "2011 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
  14. ^ "2012 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
  15. ^ "2013 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
  16. ^ "2014 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2020-09-19
  17. ^ "2015 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2020-09-19
  18. ^ "2016 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
  19. ^ "2017 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
  20. ^ "2018 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-30
  21. ^ "2019 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-09
  22. ^ "Prof. Alessandro Panconesi won Edsger W. Dijkstra Prize in Distributed Computing". Journal of Computer and System Sciences. Elsevier B.V.
  23. ^ "2020 Edsger W. Dijkstra Prize in Distributed Computing", ACM Symposium on Principles of Distributed Computing, retrieved 2019-09-09

External links[]


Retrieved from ""