Writing-all deterministically and optimally using a nontrivial number of asynchronous processors

DOI10.1145/1367064.1367073zbMath1445.68337OpenAlexW2036862097MaRDI QIDQ4962738

Dariusz R. Kowalski, Alexander A. Schwarzmann

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

distributed algorithmsshared memoryasynchronywrite-all

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Distributed algorithms (68W15)

Related Items (3)

Solving the at-most-once problem with nearly optimal effectiveness ⋮ Emulating shared-memory do-all algorithms in asynchronous message-passing systems ⋮ A tight analysis and near-optimal instances of the algorithm of Anderson and Woll

This page was built for publication: Writing-all deterministically and optimally using a nontrivial number of asynchronous processors