skip to main content
10.1145/2767386.2767447acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
announcement

Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast

Published: 21 July 2015 Publication History

Abstract

The CONGEST model is a synchronous, message-passing model of distributed computation in which each node can send (possibly different) messages of O(log n) bits along each of its incident communication links in each round, where n is the number of computing nodes in the system. In the particular case where the communication network is a complete graph, we have the unicast congested clique model. On the other end is the broadcast version of the congested clique model, in which each node can only broadcast a single message over all its links in each round. In this paper we explore the space, in terms of round complexity, that lies between these two congested clique models. Hence, we parametrize the congested clique model with the range r, the maximum number of different messages a node can send over its incident links in one round. Additionally, we study the effect of the bandwidth b, the maximum size in bits of these messages. We show that the space between the unicast and broadcast congested clique models is very rich and interesting. For instance, we show that a problem (especially designed for this work) takes Ω(n/ log n) rounds in the broadcast model (r = 1), while it can be solved in two rounds if two messages can be sent (r = 2). Other gaps are found in other parts of the spectrum of values of r. We do this by providing techniques to simulate protocols with different parameters. Therefore, we conclude that, with respect to their power to solve certain problems, there is a strict hierarchy of congested clique models.

References

[1]
K. J. Ahn, S. Guha, and A. McGregor. Analyzing graph structure via linear measurements. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pages 459--467, 2012.
[2]
K. J. Ahn, S. Guha, and A. McGregor. Graph sketches: Sparsification, spanners, and subgraphs. In Proceedings of 31st Symposium on Principles of Database Systems (PODS 2012), pages 5--14, 2012.
[3]
F. Becker, A. Kosowski, N. Nisse, I. Rapaport, and K. Suchan. Allowing each node to communicate only once in a distributed system: shared whiteboard models. In Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architecture (SPAA 2012), pages 11--17, 2012.
[4]
F. Becker, M. Matamala, N. Nisse, I. Rapaport, K. Suchan, and I. Todinca. Adding a referee to an interconnection network: What can (not) be computed in one round. In Proceedings of the 25th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2011), pages 508--514, 2011.
[5]
F. Becker, I. Rapaport, P. Montealegre, and I. Todinca. The simultaneous number-in-hand communication model for networks: private coins, public coins and determinism. In Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO 2014), pages 83--95, 2014.
[6]
D. Dolev, C. Lenzen, and S. Peled. Tri, tri again: Finding triangles and small subgraphs in a distributed setting. In Proceedings of the 25th Symposium on Distributed Computing (DISC 2012), pages 195--209, 2012.
[7]
A. Drucker, F. Kuhn, and R. Oshman. On the power of the congested clique model. In Proceedings of the 33rd ACM Symposium on Principles of Distributed Computing (PODC 2014), pages 367--376, 2014.
[8]
J. W. Hegeman, S. V. Pemmaraju, and V. B. Sardeshmukh. Near-constant-time distributed algorithms on a congested clique. In Proceedings of the 27tth Symposium on Distributed Computing (DISC 2014), pages 514--530, 2014.
[9]
C. Lenzen. Optimal deterministic routing and sorting on the congested clique. In Proceedings of the 33rd ACM Symposium on Principles of Distributed Computing (PODC 2013), pages 42--50, 2013.
[10]
Z. Lotker and E. Pavlov. MST construction in O(log log n) communication rounds. In Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architecture (SPAA 2003), pages 94--100, 2003.
[11]
B. Patt-Shamir and M. Teplitsky. The round complexity of distributed sorting. In Proceedings of the 30th ACM Symposium on Principles of Distributed Computing (PODC 2011), pages 249--256, 2011.
[12]
D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.

Cited By

View all
  • (2024)Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed ModelProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662791(380-390)Online publication date: 17-Jun-2024
  • (2020)Fully Compact Routing in Low Memory Self-Healing TreesProceedings of the 21st International Conference on Distributed Computing and Networking10.1145/3369740.3369786(1-10)Online publication date: 4-Jan-2020
  • (2019)Broadcast Congested CliqueProceedings of the 2019 ACM Symposium on Principles of Distributed Computing10.1145/3293611.3331599(248-255)Online publication date: 16-Jul-2019
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '15: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
July 2015
508 pages
ISBN:9781450336178
DOI:10.1145/2767386
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 July 2015

Check for updates

Author Tags

  1. congest model
  2. congested clique model
  3. distributed computation
  4. message passing

Qualifiers

  • Announcement

Funding Sources

  • Regional Government of Madrid
  • CONICYT
  • Fondecyt
  • Nucleo Milenio Informacion y Coordinacion en Redes

Conference

PODC '15
Sponsor:
PODC '15: ACM Symposium on Principles of Distributed Computing
July 21 - 23, 2015
Donostia-San Sebastián, Spain

Acceptance Rates

PODC '15 Paper Acceptance Rate 45 of 191 submissions, 24%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)11
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed ModelProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662791(380-390)Online publication date: 17-Jun-2024
  • (2020)Fully Compact Routing in Low Memory Self-Healing TreesProceedings of the 21st International Conference on Distributed Computing and Networking10.1145/3369740.3369786(1-10)Online publication date: 4-Jan-2020
  • (2019)Broadcast Congested CliqueProceedings of the 2019 ACM Symposium on Principles of Distributed Computing10.1145/3293611.3331599(248-255)Online publication date: 16-Jul-2019
  • (2018)Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex CoverProceedings of the 2018 ACM Symposium on Principles of Distributed Computing10.1145/3212734.3212743(129-138)Online publication date: 23-Jul-2018
  • (2017)Distributed MIS via All-to-All CommunicationProceedings of the ACM Symposium on Principles of Distributed Computing10.1145/3087801.3087830(141-149)Online publication date: 25-Jul-2017
  • (2017)Distributed MST and Routing in Almost Mixing TimeProceedings of the ACM Symposium on Principles of Distributed Computing10.1145/3087801.3087827(131-140)Online publication date: 25-Jul-2017
  • (2017)On Range and Edge Capacity in the Congested CliqueSOFSEM 2018: Theory and Practice of Computer Science10.1007/978-3-319-73117-9_22(305-318)Online publication date: 22-Dec-2017
  • (2016)MST in Log-Star Rounds of Congested CliqueProceedings of the 2016 ACM Symposium on Principles of Distributed Computing10.1145/2933057.2933103(19-28)Online publication date: 25-Jul-2016
  • (2016)The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique ModelComputing and Combinatorics10.1007/978-3-319-42634-1_15(182-193)Online publication date: 20-Jul-2016
  • (2016)Robust reconstruction of Barabási-Albert networks in the broadcast congested clique modelNetworks10.1002/net.2166267:1(82-91)Online publication date: 1-Jan-2016

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media