A method for creating near-optimal instances of a certified write-all algorithm (extended abstract)

DOI10.1007/B13632zbMATH Open1266.68202OpenAlexW1827234103MaRDI QIDQ5897265FDOQ5897265

Authors: Grzegorz Malewicz 

Publication date: 3 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13632

Recommendations

• A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
• 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
• Writing-all deterministically and optimally using a nontrivial number of asynchronous processors
• On the Complexity of Certified Write-All Algorithms

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Cited In (3)

• Distributed scheduling for disconnected cooperation
• Algorithms for the Certified Write-All Problem
• A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors

This page was built for publication: A method for creating near-optimal instances of a certified write-all algorithm (extended abstract)

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