A work-optimal deterministic algorithm for the asynchronous certified write-all problem

DOI10.1145/872035.872075MaRDI QIDQ2943762zbMATH OpenOpenAlexFDO

Authors Grzegorz Malewicz

Publication date 4 September 2015

Published in Proceedings of the twenty-second annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/872035.872075

zbMATH Keywords

design and analysis of parallel algorithmswrite-all

Mathematics Subject Classification ID

Distributed systems (68M14) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Analysis of algorithms (68W40)

Recommendations

• A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors
• Writing-all deterministically and optimally using a nontrivial number of asynchronous processors
• On the Complexity of Certified Write-All Algorithms
• A method for creating near-optimal instances of a certified write-all algorithm (extended abstract)
• Algorithms for the Certified Write-All Problem

Cited in

(6)

• On the Complexity of Certified Write-All Algorithms
• Algorithms for the Certified Write-All Problem
• Writing-all deterministically and optimally using a nontrivial number of asynchronous processors
• An algorithm for the asynchronous \textit{Write-All} problem based on process collision
• 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)

This page was built for publication: A work-optimal deterministic algorithm for the asynchronous certified write-all problem

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