The Do-All problem with Byzantine processor failures

DOI10.1016/J.TCS.2004.06.034MaRDI QIDQ1770376zbMATH OpenOpenAlexFDO

Authors Xianqiang Yang, Antonio Fernández Anta, Chryssis Georgiou, Alexander Russell, Alexander A. Schwarzmann

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 failuresDistributed cooperationIndependent tasksWork complexity

Mathematics Subject Classification ID

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

Recommendations

• Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
• Consensus in the presence of mortal Byzantine faulty processes
• Byzantine Fault Detectors for Solving Consensus
• The Byzantine generals problem
• Two distributed problems involving Byzantine processes
• The Weak Byzantine Generals Problem
• Highly dynamic distributed computing with Byzantine failures
• Tolerating Random Byzantine Failures in an Unbounded Network

Cites work

• Algorithms for the Certified Write-All Problem
• An algorithm for the asynchronous \textit{Write-All} problem based on process collision
• Bounding work and communication in robust cooperative computation
• Building agent teams using an explicit teamwork model and learning
• Cooperative computing with fragmentable and mergeable groups
• Distributed cooperation during the absence of communication
• scientific article; zbMATH DE number 1306905 (Why is no real title available?)
• scientific article; zbMATH DE number 1033646 (Why is no real title available?)
• On the Complexity of Certified Write-All Algorithms
• Parallel Algorithms with Processor Failures and Delays
• Performing tasks on synchronous restartable message-passing processors
• Performing Work Efficiently in the Presence of Faults
• The Byzantine Generals Problem
• The complexity of synchronous iterative do-all with crashes
• Time-optimal message-efficient work performance in the presence of faults
• Work-competitive scheduling for cooperative computing with dynamic groups
• Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers

Cited in

(13)

• A robust randomized algorithm to perform independent tasks
• Two distributed problems involving Byzantine processes
• Are Byzantine failures really different from crash failures?
• Performing work in broadcast networks
• RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS
• The Weak Byzantine Generals Problem
• Optimal F-reliable protocols for the do-all problem on single-hop wireless networks
• The complexity of synchronous iterative do-all with crashes
• Bounding work and communication in robust cooperative computation
• Performing tasks on synchronous restartable message-passing processors
• The complexity of synchronous iterative do-all with crashes
• Doing-it-all with bounded work and communication
• Emulating shared-memory do-all algorithms in asynchronous message-passing systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1770376)