|
|
|
|
|
|
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 (even years) and EATCS DISC (odd years).
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 and EATCS DISC proceedings of that year, describing the paper's lasting contributions.
|
The Award Committee
The winner of the Prize is selected by a committee of six members.
The Award Committee will consist of the current PODC and DISC program
chairs, the PODC program chairs from five and ten years ago, and the DISC
program chairs from five and ten years ago. The Award Committee will be
chaired alternatively by the current PODC (odd years) and DISC (even years)
program chairs. If any of the two earlier PODC or DISC program chairs are
unable to serve on the committee, then the current committee chair will find a replacement of similar stature.
If the resulting committee consists of less than six distinct members
(due to one or more persons being eligible to serve on the committee
in multiple roles) then the chair of the committee will select
addition member(s) of similar stature so that the committee
consists of six members.
|
Nominations and Eligibility
At least four months prior to each year's PODC or DISC (whichever comes
earlier), a Call for Nominations will be posted on the PODC and DISC
mailing lists. 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 can nominate papers as well. However,
they must carefully consider nominations from within the community. Members of the Award Committee should be especially sensitive to
conflict-of-interests issues if papers by former students or close
colleagues are nominated (members of the Award Committee cannot nominate
such papers themselves).
|
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.
|
Financing the Award
-
The award is financed with the combination of income from endowments and registration
fees. Each of ACM PODC and EATCS DISC will provide an equal share of $1,000 towards the
$2,000 award at least two weeks prior to the official start date of the conference at
which the prize will be awarded.
-
The PODC share is financed with income from 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. If the income from the endowment is
insufficient to fund a year's prize, the prize will be financed partially from the
endowment and partially from that year's PODC budget.
-
The DISC share is financed with income from 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 Ministerio de Ciencia e Innovación of Spain.
If the income from the endowment is insufficient to fund a year's prize, the prize
will be financed partially from the endowment and partially from that year's DISC
budget.
-
If either PODC or DISC is unable to produce $1,000, then the value of the award will
be the sum of the amounts produced.
-
Should one party (PODC or DISC) be unable two times to produce its $1,000 share of the
award, then the steering committee of the other party will have the option of revising
the definition of the Award Committee and determining the venue where the award will be
presented, unless both parties can come to a mutually agreeable resolution.
-
Should both parties (PODC and DISC) be unable two times to produce the respective
$1,000, then the definition of the award will be referred to ACM and EATCS for a
mutually agreeable resolution.
|
Past Prizes:
Prizes in the years 2000-2002 were given under the name "PODC Influential-Paper Award".
2009:
Joseph Halpern and Yoram Moses for
"Knowledge and Common Knowledge in a Distributed Environment",
Journal of the ACM, Vol. 37, No. 3, January, 1990.
[more]
2008:
Baruch Awerbuch and David Peleg for
"Sparse Partitions",
Proceedings of the 31st Annual Symposium on Foundations of Computer Science (FOCS), 503-513, October 1990..
[more]
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.
[more]
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.
[more]
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.
[more]
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.
[more]
2003:
Maurice Herlihy for
"Wait-Free Synchronization",
ACM Transactions on Programming Languages and Systems, January 1991, 13(1):124-149.
[more]
2002:
Edsger W. Dijkstra for
"Self-stabilizing systems in spite of distributed control",
Communications of the ACM, 1974, 17(11):643-644.
[more]
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.
[more]
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.
[more]
|
|