Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Renaming in an asynchronous environment
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Atomic snapshots of shared memory
Journal of the ACM (JACM)
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
The decidability of distributed decision tasks (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Unifying synchronous and asynchronous message-passing models
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Atomic Snapshots in O (n log n) Operations
SIAM Journal on Computing
Three-Processor Tasks Are Undecidable
SIAM Journal on Computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
SIAM Journal on Computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
The BG distributed simulation algorithm
Distributed Computing
Distributed Algorithms
The Combinatorial Structure of Wait-Free Solvable Tasks
SIAM Journal on Computing
A Layered Analysis of Consensus
SIAM Journal on Computing
A classification of wait-free loop agreement tasks
Theoretical Computer Science - Special issue: Distributed computing
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Multi-writer composite registers
Distributed Computing
Synchronization Algorithms and Concurrent Programming
Synchronization Algorithms and Concurrent Programming
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
The Iterated Restricted Immediate Snapshot Model
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Classifying rendezvous tasks of arbitrary dimension
Theoretical Computer Science
The Art of Multiprocessor Programming
The Art of Multiprocessor Programming
The topology of shared-memory adversaries
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Concurrent computing and shellable complexes
DISC'10 Proceedings of the 24th international conference on Distributed computing
Recursion in distributed computing
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Distributed programming with tasks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
The universe of symmetry breaking tasks
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
A liveness condition for concurrent objects: x-wait-freedom
Concurrency and Computation: Practice & Experience
Help when needed, but no more: Efficient read/write partial snapshot
Journal of Parallel and Distributed Computing
Locality and checkability in wait-free computing
DISC'11 Proceedings of the 25th international conference on Distributed computing
Subconsensus tasks: renaming is weaker than set agreement
DISC'06 Proceedings of the 20th international conference on Distributed Computing
The renaming problem in shared memory systems: An introduction
Computer Science Review
Simulations and reductions for colorless tasks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
From unreliable objects to reliable objects: the case of atomic registers and consensus
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Concurrent Programming: Algorithms, Principles, and Foundations
Concurrent Programming: Algorithms, Principles, and Foundations
| Hi-index | 0.00 |
What can and cannot be computed in a distributed system is a complex function of the system's communication model, timing model, and failure model. This tutorial surveys some important results about computability in the canonical distributed system model, where processes execute asynchronously, they communicate by reading and writing shared memory, and they fail by crashing. It explains the fundamental role that topology plays in the distributed computability theory.