The Do-All problem with Byzantine processor failures

DOI10.1016/j.tcs.2004.06.034zbMath1070.68151OpenAlexW2148302487MaRDI QIDQ1770376

Xianqiang Yang

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

zbMATH Keywords

Byzantine failuresIndependent tasksDistributed cooperationWork complexity

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (4)

Performing work in broadcast networks ⋮ Doing-it-all with bounded work and communication ⋮ A robust randomized algorithm to perform independent tasks ⋮ RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS

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

This page was built for publication: The Do-All problem with Byzantine processor failures