Dijkstra Prize

The Edsger W. Dijkstra Award-winning in Broadcast Accretion is accustomed for outstanding affidavit on the attempt of broadcast computing, whose acceptation and appulse on the approach and/or convenance of broadcast accretion has been axiomatic for at atomic a decade. The award-winning has been presented annually back 2000.

Originally the award-winning was presented at the ACM Symposium on Attempt of Broadcast Accretion (PODC), and it was accepted as the

PODC Influential-Paper Award

It was renamed in account of Edsger W. Dijkstra in 2003, afterwards he accustomed the accolade for his assignment in self-stabilization in 2002 and died anon thereafter.

Since 2007,1 the award-winning is sponsored accordingly by PODC and the EATCS International Symposium on Distributed Computing (DISC), and the presentation takes abode alternately at PODC (even years) and DISC (odd years). The award-winning includes an accolade of $2000.

Winners

Year Paper Topic

20002 Lamport, L. (1978). "Time, clocks, and the acclimation of contest in a broadcast system". Communications of the ACM 21 (7): 558–565. doi:10.1145/359545.359563. adapt Lamport analytic clock

20013 Fischer, M. J.; Lynch, N. A.; Paterson, M. S. (1985). "Impossibility of broadcast accord with one adulterated process". Journal of the ACM 32 (2): 374–382. doi:10.1145/3149.214121. adapt Proving the impossibility of accord application asynchronous communication

2002 Dijkstra, E. W. (November 1974). "Self-stabilizing systems in animosity of broadcast control". Communications of the ACM 17 (11): 643-644. doi:10.1145/361179.361202. adapt Self-stabilization

20034 Herlihy, M. (1991). "Wait-free synchronization". ACM Transactions on Programming Languages and Systems 13 (1): 124–149. doi:10.1145/114005.102808. adapt Maurice Herlihy Solvability and absoluteness of accord in shared-memory systems

20045 Gallager, R. G.; Humblet, P. A.; Spira, P. M. (1983). "A Broadcast Algorithm for Minimum-Weight Spanning Trees". ACM Transactions on Programming Languages and Systems 5 (1): 66–77. doi:10.1145/357195.357200. adapt Distributed algorithm to acquisition a minimum spanning tree

20056 Pease, M.; Shostak, R.; Lamport, L. (April 1980). "Reaching Agreement in the Attendance of Faults". Journal of the ACM 27 (2): 228–234. doi:10.1145/322186.322188. adapt 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. adapt "probably the best affecting applied alternate exclusion algorithm of all time"7

20078 Dwork, C.; Lynch, N.; Stockmeyer, L. (1988). "Consensus in the attendance of fractional synchrony". Journal of the ACM 35 (2): 288–323. doi:10.1145/42282.42283. adapt Solving accord in partially ancillary systems

20089 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 0-8186-2082-X. adapt Sparse partitions

2009 Halpern, J. Y.; Moses, Y. (1990). "Knowledge and Common Ability in a Broadcast Environment". Journal of the ACM 37 (3): 549–587. doi:10.1145/79147.79161. adapt A academic framework for acumen about ability in broadcast systems

2010 Chandra, T. D.; Toueg, S. (1996). "Unreliable Failure Detectors for Reliable Broadcast 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. adapt Failure detectors

2011 Attiya, H.; Bar-Noy, A.; Dolev, D. (1995). "Sharing Anamnesis Robustly in Message-Passing Systems". Journal of the ACM 42 (1): 124-142. doi:10.1145/200836.200869. adapt Simulating aggregate anamnesis in fault-prone message-passing systems

Funding

The accolade is financed by ACM PODC and EATCS DISC, anniversary accouterment an according allotment of $1,000 appear the $2,000 of the award.

The PODC allotment is financed by an award at ACM that is based on ability 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 allotment is financed by an award at EATCS that is based on contributions from several year's DISC budgets, and ability from Microsoft Research, the Universidad Rey Juan Carlos and the Spanish Ministry of Science and Innovation.

nfluence