Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Efficient robust parallel computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Combining tentative and definite executions for very fast dependable parallel computing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Time-optimal message-efficient work performance in the presence of faults
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Parallel algorithms with processor failures and delays
Journal of Algorithms
Algorithms for the Certified Write-All Problem
SIAM Journal on Computing
Performing Work Efficiently in the Presence of Faults
SIAM Journal on Computing
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Towards practical deteministic write-all algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Fault-Tolerant Parallel Computation
Fault-Tolerant Parallel Computation
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Resolving message complexity of Byzantine Agreement and beyond
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Cooperative computing with fragmentable and mergeable groups
Journal of Discrete Algorithms
Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
SIAM Journal on Computing
Efficient gossip and robust distributed computation
Theoretical Computer Science
Do-All Computing in Distributed Systems
Do-All Computing in Distributed Systems
Dynamic load balancing with group communication
Theoretical Computer Science
Writing-all deterministically and optimally using a nontrivial number of asynchronous processors
ACM Transactions on Algorithms (TALG)
A robust randomized algorithm to perform independent tasks
Journal of Discrete Algorithms
Performing work with asynchronous processors: Message-delay-sensitive bounds
Information and Computation
| Hi-index | 0.00 |
A fundamental problem in distributed computing is performing a set of tasks despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processors. This paper studies the efficiency of emulating shared-memory task-performing algorithms on asynchronous message-passing processors with quantifiable message latency. Efficiency is measured in terms of work and communication, and the challenge is to obtain subquadratic work and message complexity. While prior solutions assumed synchrony and constant delays, the solutions given here yield subquadratic efficiency with asynchronous processors when the delays and failures are suitably constrained. The solutions replicate shared objects using a quorum system, provided it is not disabled. One algorithm has subquadratic work and communication when the delays and the number of processors, K, owning object replicas, are O(P^0^.^4^1). It tolerates @?K-12@? crashes. It is also shown that there exists an algorithm that has subquadratic work and communication and that tolerates o(P) failures, provided message delays are sublinear.