Writing-all deterministically and optimally using a nontrivial number of asynchronous processors
From MaRDI portal
Publication:4962738
DOI10.1145/1367064.1367073zbMath1445.68337MaRDI 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
Related Items
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