Performing Work Efficiently in the Presence of Faults
From MaRDI portal
Publication:4210118
Recommendations
- Performing work efficiently in the presence of faults
- Message-optimal protocols for fault-tolerant broadcasts/multicasts in distributed systems with crash failures
- Performing work in broadcast networks
- Performing tasks on synchronous restartable message-passing processors
- Distributed agreement in the presence of processor and communication faults
Cited in
(28)- Robust gossiping with an application to consensus
- Designing proof of human-work puzzles for cryptocurrency and beyond
- Early Detection of Message Forwarding Faults
- Computing reliability intervals for k-resilient protocols
- Locating and repairing faults in a network with mobile agents
- scientific article; zbMATH DE number 2086463 (Why is no real title available?)
- Performing tasks on synchronous restartable message-passing processors
- scientific article; zbMATH DE number 1979510 (Why is no real title available?)
- Brief Announcement: Improved Consensus in Quantum Networks
- Efficient gossip and robust distributed computation
- Performing work with asynchronous processors: Message-delay-sensitive bounds
- The assignment problem
- Performing work efficiently in the presence of faults
- Emulating shared-memory do-all algorithms in asynchronous message-passing systems
- Distributed scheduling for disconnected cooperation
- Dynamic load balancing with group communication
- Implementing fail-silent nodes for distributed systems
- Threshold protocols in survivor set systems
- scientific article; zbMATH DE number 1950668 (Why is no real title available?)
- Performing work in broadcast networks
- RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS
- Cooperative computing with fragmentable and mergeable groups
- Doing-it-all with bounded work and communication
- Ordered and delayed adversaries and how to work against them on a shared channel
- The Do-All problem with Byzantine processor failures
- Dealing with undependable workers in decentralized network supercomputing
- Performing dynamically injected tasks on processes prone to crashes and restarts
- A robust randomized algorithm to perform independent tasks
This page was built for publication: Performing Work Efficiently in the Presence of Faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210118)
