On the average communication complexity of asynchronous distributed algorithms

DOI10.1145/201019.201029MaRDI QIDQ4369868zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Average and Randomized Complexity of Distributed Problems
• Parallel Processing and Applied Mathematics
• The communication complexity of distributed task allocation
• scientific article; zbMATH DE number 1202979
• scientific article; zbMATH DE number 1333604
• On the communication complexity of distributed algebraic computation
• On the message complexity of distributed problems
• scientific article; zbMATH DE number 6691438
• The Communication Complexity of Distributed epsilon-Approximations

Cited in

(6)

• Some aspects of parallel and distributed iterative algorithms - a survey
• Second-Order Asymptotics for Communication Under Strong Asynchronism
• Iteration grain sized asynchronous parallel algorithms in optimization
• The Communication Complexity of Distributed epsilon-Approximations
• Average and Randomized Complexity of Distributed Problems
• Exchanging messages of different sizes

This page was built for publication: On the average communication complexity of asynchronous distributed algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4369868)