A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors

DOI10.1137/S0097539703428014zbMath1075.68097MaRDI QIDQ5317185

Grzegorz Malewicz

Publication date: 16 September 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

deterministic algorithmsasynchronydesign and analysis of parallel algorithmscertified write-all

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10)

Related Items (2)

Solving the at-most-once problem with nearly optimal effectiveness ⋮ A tight analysis and near-optimal instances of the algorithm of Anderson and Woll

This page was built for publication: A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors