On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The structure of the “THE”-multiprogramming system
Communications of the ACM
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Distributed Algorithms
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Operating System Concepts
Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
ACM SIGACT news distributed computing column 13
ACM SIGACT News
Dynamic task scheduling for irregular network topologies
Parallel Computing - Heterogeneous computing
Fast generators for the Diffie-Hellman key agreement protocol and malicious standards
Information Processing Letters
Efficient pseudorandom functions from the decisional linear assumption and weaker variants
Proceedings of the 16th ACM conference on Computer and communications security
The truth system: can a system of lying processes stabilize?
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
The field of distributed computing started around 1970 when people began to imagine a future world of multiple interconnected computers operating collectively. The theoretical challenge was to define what a computational problem would be in such a setting and to explore what could and could not be accomplished in a realistic setting in which the different computers fell under different administrative structures, operated at different speeds under the control of uncoordinated clocks, and sometimes failed in unpredictable ways. Meanwhile, the practical problem was to turn the vision into reality by building networks and networking equipment, communication protocols, and useful distributed applications. The theory of distributed computing became recognized as a distinct discipline with the holding of the first ACM Principles of Distributed Computing conference in 1982. This paper reviews some of the accomplishments of the theoretical community during the past two decades, notes an apparent disconnect between theoretical and practical concerns, and speculates on future synergy between the two.