List of important publications in concurrent, parallel, and distributed computing

Further information: Edsger W. Dijkstra Prize in Broadcast Computing

This is a account of important publications in concurrent, parallel, and broadcast computing, organized by field.

Some affidavit why a accurate advertisement ability be admired as important:

Topic architect – A advertisement that created a fresh topic

Breakthrough – A advertisement that afflicted accurate ability significantly

Access – A advertisement which has decidedly influence

Consensus, synchronisation, and mutual exclusion

Synchronising circumstantial processes. Achieving accord in a broadcast arrangement in the attendance of adulterated nodes, or in a wait-free manner. Alternate exclusion in circumstantial systems.

Dijkstra: “Solution of a botheration in circumstantial programming control”

Dijkstra, E. W. (1965). "Solution of a botheration in circumstantial programming control". Communications of the ACM 8 (9): 569. doi:10.1145/365559.365617. edit

This cardboard presented the aboriginal band-aid to the alternate exclusion problem. Leslie Lamport writes that this assignment “started the acreage of circumstantial and broadcast algorithms”.1

Pease, Shostak, Lamport: “Reaching agreement in the presence of faults” Lamport, Shostak, Pease: “The Byzantine generals problem”

Pease, Marshall; Shostak, Robert; Lamport, Leslie (1980), "Reaching acceding in the attendance of faults", Journal of the ACM 27 (1): 228–234, doi:10.1145/322186.322188.

Lamport, Leslie; Shostak, Robert; Pease, Marshall (1982), "The Byzantine generals problem", ACM Transactions on Programming Languages and Systems 4 (3): 382–401, doi:10.1145/357172.357176.

These two affidavit alien and advised the botheration that is nowadays accepted as Byzantine accountability tolerance. The 1980 cardboard presented the classical lower apprenticed that acceding is absurd if at atomic 1/3 of the nodes are faulty; it accustomed the Edsger W. Dijkstra Prize in Distributed Computing in 2005.2 The highly-cited 1982 cardboard gave the botheration its present name, and additionally presented algorithms for analytic the problem.3

Herlihy, Shavit: “The topological structure of asynchronous computation” Saks, Zaharoglou: “Wait-free k-set agreement is impossible …”

Herlihy, Maurice; Shavit, Nir (1999), "The topological anatomy of asynchronous computation", Journal of the ACM 46 (6): 858–923, doi:10.1145/331524.331529. Gödel award-winning lecture.

Saks, Michael; Zaharoglou, Fotios (2000), "Wait-free k-set acceding is impossible: The cartography of accessible knowledge"", SIAM Journal on Computing 29 (5): 1449–1483, doi:10.1137/S0097539796307698.

These two affidavit abstraction wait-free algorithms for generalisations of the accord problem, and showed that these problems can be analysed by application topological backdrop and arguments. Both affidavit accustomed the Gödel Award-winning in 2004.4

Foundations of distributed systems

Fundamental concepts such as time and ability in broadcast systems.

Halpern, Moses: “Knowledge and accepted ability in a broadcast environment”

Halpern, Joseph; Moses, Yoram (1990), "Knowledge and accepted ability in a broadcast environment", Journal of the ACM 37 (3): 549–587, doi:10.1145/79147.79161.

This cardboard formalised the angle of “knowledge” in broadcast systems, approved the accent of the abstraction of “common knowledge” in broadcast systems, and additionally accepted that accepted ability cannot be accomplished if advice is not guaranteed. The cardboard accustomed the Gödel Prize in 1997 and the Edsger W. Dijkstra Prize in Broadcast Computing in 2009.56