On the average communication complexity of asynchronous distributed algorithms

DOI10.1145/201019.201029zbMath0886.68070OpenAlexW2006569536MaRDI QIDQ4369868

George D. Stamoulis, John N. Tsitsiklis

Publication date: 2 February 1998

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

communication complexityasynchronous distributed algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Parallel algorithms in computer science (68W10)

Related Items

Some aspects of parallel and distributed iterative algorithms - a survey, Iteration grain sized asynchronous parallel algorithms in optimization