An algorithm for the asynchronous Write-All problem based on process collision

DOI10.1007/PL00008930zbMath1448.68471MaRDI QIDQ5138352

Wim H. Hesselink, Rogier Vermeulen, Sjouke Mauw, Jan Friso Groote

Publication date: 3 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (5)

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 ⋮ A tight analysis and near-optimal instances of the algorithm of Anderson and Woll ⋮ The Do-All problem with Byzantine processor failures

Cites Work

• Efficient parallel algorithms can be made robust
• Parallel Algorithms with Processor Failures and Delays
• Unnamed Item

This page was built for publication: An algorithm for the asynchronous Write-All problem based on process collision