|
The Dijkstra Award Committee for 2008 has selected Baruch Awerbuch and David
Peleg as the recipients of this year's Edsger W. Dijkstra Prize in Distributed
Computing. The prize is awarded for their outstanding paper: "Sparse
Partitions" published in FOCS 1990.
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,
semaphores, mutual exclusion, deadlock, finding shortest paths in
graphs, fault-tolerance, self-stabilization, among many other
contributions 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 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 Prize includes an award of $2000.
The Prize is sponsored jointly by the ACM Symposium on Principles of
Distributed Computing (PODC) and the EATCS Symposium on Distributed
Computing (DISC). This award is presented annually, with the
presentation taking place alternately at ACM PODC and EATCS DISC -
this year it will be presented at PODC 2008. The winners of the
award will share the cash award, and each winning author will be
presented with a plaque. An announcement of each year's prize
recipient(s) will be included in the ACM PODC or EATCS DISC
proceedings of that year, describing the paper's lasting contributions.
Nominations and Eligibility
Nominations may be made by any member of the scientific community.
Each nomination must identify the paper being nominated and include
a short paragraph (approximately 200 words) justifying the
nomination. Papers appearing in any conference proceedings or
journal are eligible, as long as they have had a significant impact
on research areas of interest within the theory of distributed
computing community, and as long as the year of the original
publication is at least ten years prior to the year in which the
award is given.
Papers authored or co-authored by members of the Award Committee
will not be eligible for consideration. Members of the Award
Committee will be especially sensitive to conflict-of-interests
issues if papers by former students or close colleagues are
nominated.
Please send your nomination to the Chair of the Award Committee,
Gadi Taubenfeld (tgadi[AT]idc.ac.il). Please mind that the
nominations deadline is June 1, 2008.
Selection Process
Although the Award Committee is encouraged to consult with the
distributed computing community at large, the Award Committee is
solely responsible for the selection of the winner of the award. The
prize may be shared by more than one paper. All matters relating to
the selection process that are not specified here are left to the
discretion of the Award Committee.
Award Committee 2008
| Yehuda Afek | Tel-Aviv Univ. |
| Faith Ellen | University of Toronto |
| Shay Kutten | Technion |
| Boaz Patt-Shamir | Tel-Aviv Univ. |
| Sergio Rajsbaum | UNAM |
| Gadi Taubenfeld, Chair | IDC |
Past Prizes
| Year |
Prize |
| 2008 |
Baruch Awerbuch and David Peleg for their paper "Sparse Partitions" published in FOCS 1990
|
| 2007 |
Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer for "Consensus in the presence of partial synchrony", Journal of the ACM, Vol. 35, No. 2, April, 1988. pages 288--323 (a preliminary version appeared in PODC 1984)
|
| 2006 |
John M. Mellor-Crummey and Michael L. Scott for "Algorithms for scalable synchronization on shared-memory multiprocessors", ACM Transactions on Computer Systems, 9(1), 1991
|
| 2005 |
Marshal Pease , Robert Shostak and Leslie Lamport for "Reaching agreement in the presence of faults", Journal of the Association of Computing Machinery, April, 1980, 27(1):228-234
|
| 2004 |
R. G. Gallager , P. A. Humblet and P. M. Spira for "A Distributed Algorithm for Minimum-Weight Spanning Trees", ACM Transactions on Programming Languages and Systems, January 1983, 5(1):66-77
|
| 2003 |
Maurice Herlihy for "Wait-Free Synchronization", ACM Transactions on Programming Languages and Systems, January 1991, 13(1):124-149
|
| 2002 |
Edsger W. Dijkstra for "Self-stabilizing systems in spite of distributed control", Communications of the ACM, 1974, 17(11):643-644
|
| 2001 |
Michael J. Fischer , Nancy A. Lynch and Michael S. Paterson for "Impossibility of Distributed Consensus with One Faulty Process", Journal of the ACM, April 1985, 32(2):374-382
|
| 2000 |
Leslie Lamport for "Time, Clocks, and the Ordering of Events in a Distributed System", Communications of the ACM, July 1978, 21(7):558-565
|
Prizes in the years 2000-2002 were given under the name "PODC Influential-Paper Award".
|