On the Complexity of Certified Write-All Algorithms

DOI10.1006/JAGM.1994.1017zbMath0804.68065OpenAlexW2022179515MaRDI QIDQ4290913

Ramesh Subramonian, Charles U. Martel

Publication date: 5 May 1994

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1994.1017

zbMATH Keywords

parallel computationsynchronizationcertified write-all problemasynchronous PRAM algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Related Items (6)

Clock construction in fully asynchronous parallel systems and PRAM simulation ⋮ Hundreds of impossibility results for distributed computing ⋮ The complexity of synchronous iterative Do-All with crashes ⋮ Dealing with undependable workers in decentralized network supercomputing ⋮ A tight analysis and near-optimal instances of the algorithm of Anderson and Woll ⋮ The Do-All problem with Byzantine processor failures

This page was built for publication: On the Complexity of Certified Write-All Algorithms