Algorithms for the Certified Write-All Problem
From MaRDI portal
Publication:4376186
DOI10.1137/S0097539794319126zbMATH Open0885.68060MaRDI QIDQ4376186FDOQ4376186
Authors: Richard J. Anderson, Heather Woll 
Publication date: 10 February 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Recommendations
- On the Complexity of Certified Write-All Algorithms
- A work-optimal deterministic algorithm for the asynchronous certified write-all problem
- A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors
- A method for creating near-optimal instances of a certified write-all algorithm (extended abstract)
- Cooperative asynchronous update of shared memory
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)
Cited In (12)
- Solving the at-most-once problem with nearly optimal effectiveness
- Online parallel scheduling of non-uniform tasks: trading failures for energy
- A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
- Hundreds of impossibility results for distributed computing
- The Do-All problem with Byzantine processor failures
- The complexity of synchronous iterative do-all with crashes
- Efficient gossip and robust distributed computation
- Performing work with asynchronous processors: Message-delay-sensitive bounds
- Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains
- Oblivious Collaboration
- Emulating shared-memory do-all algorithms in asynchronous message-passing systems
- A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors
This page was built for publication: Algorithms for the Certified Write-All Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376186)
