The Do-All problem with Byzantine processor failures
From MaRDI portal
Publication:1770376
DOI10.1016/j.tcs.2004.06.034zbMath1070.68151MaRDI QIDQ1770376
Publication date: 6 April 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.06.034
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
68W15: Distributed algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Building agent teams using an explicit teamwork model and learning
- Cooperative computing with fragmentable and mergeable groups
- Work-competitive scheduling for cooperative computing with dynamic groups
- The Byzantine Generals Problem
- Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers
- Performing Work Efficiently in the Presence of Faults
- On the Complexity of Certified Write-All Algorithms
- Algorithms for the Certified Write-All Problem
- Parallel Algorithms with Processor Failures and Delays
- Performing tasks on synchronous restartable message-passing processors
- An algorithm for the asynchronous Write-All problem based on process collision
- The complexity of synchronous iterative Do-All with crashes
- Time-optimal message-efficient work performance in the presence of faults