Algorithms for the Certified Write-All Problem
From MaRDI portal
Publication:4376186
DOI10.1137/S0097539794319126zbMath0885.68060MaRDI QIDQ4376186
Heather Woll, Richard J. Anderson
Publication date: 10 February 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)
Related Items
Solving the at-most-once problem with nearly optimal effectiveness ⋮ Hundreds of impossibility results for distributed computing ⋮ The complexity of synchronous iterative Do-All with crashes ⋮ Emulating shared-memory do-all algorithms in asynchronous message-passing systems ⋮ A tight analysis and near-optimal instances of the algorithm of Anderson and Woll ⋮ The Do-All problem with Byzantine processor failures ⋮ Oblivious Collaboration ⋮ Efficient gossip and robust distributed computation ⋮ Performing work with asynchronous processors: Message-delay-sensitive bounds ⋮ Online parallel scheduling of non-uniform tasks: trading failures for energy