An algorithm for the asynchronous \textit{Write-All} problem based on process collision

DOI10.1007/PL00008930zbMATH Open1448.68471MaRDI QIDQ5138352FDOQ5138352

Authors: Jan Friso Groote, W. H. Hesselink, Sjouke Mauw, Rogier Vermeulen 

Publication date: 3 December 2020

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

Recommendations

• Writing-all deterministically and optimally using a nontrivial number of asynchronous processors
• A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors
• Cooperative asynchronous update of shared memory
• A work-optimal deterministic algorithm for the asynchronous certified write-all problem
• On the Complexity of Certified Write-All Algorithms

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites Work

• Title not available (Why is that?)
• Efficient parallel algorithms can be made robust
• Parallel Algorithms with Processor Failures and Delays

Cited In (6)

• Solving the at-most-once problem with nearly optimal effectiveness
• 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
• Writing-all deterministically and optimally using a nontrivial number of asynchronous processors

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138352)