Message lower bounds via efficient network synchronization

Gopal Pandurangan, David Peleg, Michele Scquizzato

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations


We present a uniform approach to derive message-time tradeoffs and message lower bounds for synchronous distributed computations using results from communication complexity theory. Since the models used in the classical theory of communication complexity are inherently asynchronous, lower bounds do not directly apply in a synchronous setting. To address this issue, we show a general result called Synchronous Simulation Theorem (SST) which allows to obtain message lower bounds for synchronous distributed computations by leveraging lower bounds on communication complexity. The SST is a by-product of a new efficient synchronizer for complete networks, called σ, which has simulation overheads that are only logarithmic in the number of synchronous rounds with respect to both time and message complexity in the CONGEST model. The σ synchronizer is particularly efficient in simulating synchronous algorithms that employ silence. In particular, a curious property of this synchronizer, which sets it apart from its predecessors, is that it is time-compressing, and hence in some cases it may result in a simulation that is faster than the original execution. While the SST gives near-optimal message lower bounds up to large values of the number of allowed synchronous rounds r (usually polynomial in the size of the network), it fails to provide meaningful bounds when a very large number of rounds is allowed. To complement the bounds provided by the SST, we then derive message lower bounds for the synchronous message-passing model that are unconditional, that is, independent of r, via direct reductions from multi-party communication complexity. We apply our approach to show (almost) tight message-time tradeoffs and message lower bounds for several fundamental problems in the synchronous message-passing model of distributed computation. These include sorting, matrix multiplication, and many graph problems. All these lower bounds hold for any distributed algorithms, including randomized Monte Carlo algorithms.

Original languageEnglish
Title of host publicationStructural Information and Communication Complexity - 23rd International Colloquium, SIROCCO 2016, Revised Selected Papers
EditorsJukka Suomela
PublisherSpringer Verlag
Number of pages17
ISBN (Print)9783319483139
StatePublished - 2016
Externally publishedYes
Event23rd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2016 - Helsinki, Finland
Duration: 19 Jul 201621 Jul 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9988 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference23rd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2016

Bibliographical note

Publisher Copyright:
© Springer International Publishing AG 2016.


Dive into the research topics of 'Message lower bounds via efficient network synchronization'. Together they form a unique fingerprint.

Cite this