Performing Work Efficiently in the Presence of Faults
From MaRDI portal
Publication:4210118
DOI10.1137/S0097539793255527zbMATH Open0907.68099OpenAlexW2065160440MaRDI QIDQ4210118FDOQ4210118
Authors: Cynthia Dwork, Joseph Y. Halpern, Orli Waarts 
Publication date: 21 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539793255527
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
Reliability, availability, maintenance, inspection in operations research (90B25) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)
Cited In (28)
- Early Detection of Message Forwarding Faults
- Computing reliability intervals for k-resilient protocols
- Robust gossiping with an application to consensus
- A robust randomized algorithm to perform independent tasks
- Locating and repairing faults in a network with mobile agents
- Ordered and delayed adversaries and how to work against them on a shared channel
- Designing proof of human-work puzzles for cryptocurrency and beyond
- The Do-All problem with Byzantine processor failures
- Performing dynamically injected tasks on processes prone to crashes and restarts
- Distributed scheduling for disconnected cooperation
- Performing work in broadcast networks
- Efficient gossip and robust distributed computation
- Performing work with asynchronous processors: Message-delay-sensitive bounds
- The assignment problem
- RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS
- Dealing with undependable workers in decentralized network supercomputing
- Brief Announcement: Improved Consensus in Quantum Networks
- Implementing fail-silent nodes for distributed systems
- Dynamic load balancing with group communication
- Threshold protocols in survivor set systems
- Cooperative computing with fragmentable and mergeable groups
- Title not available (Why is that?)
- Performing tasks on synchronous restartable message-passing processors
- Title not available (Why is that?)
- Emulating shared-memory do-all algorithms in asynchronous message-passing systems
- Performing work efficiently in the presence of faults
- Title not available (Why is that?)
- Doing-it-all with bounded work and communication
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)
