Work

Message Optimality and Message-Time Trade-offs for APSP and Beyond

Year: 2025

Type: conference-paper

Abstract: Round complexity is an extensively studied metric of distributed algorithms. In contrast, our knowledge of the message complexity of distributed computing problems and its relationship (if any) with round complexity is still quite limited. To illustrate, for many fundamental distributed graph optimization problems such as (exact) diameter computation, All-Pairs Shortest Paths (APSP), Maximum Matching etc., while (near) round-optimal algorithms are known, message-optimal algorithms are hitherto unknown. More importantly, the existing round-optimal algorithms are not message-optimal. This raises two important questions: (1) Can we design message-optimal algorithms for these problems? (2) Can we give message-time tradeoffs for these problems in case the message-optimal algorithms are not round-optimal?

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/3732772.3733506

Authors: Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram Pemmaraju, Peter Robinson

Institutions: Lancaster University, Indian Institute of Technology Madras, University of Houston, University of Iowa, Augusta University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funders: National Science Foundation, Army Research Office

Awards: Collaborative Research: AF: Medium: The Communication Cost of Distributed Computation, G4652807527, Collaborative Research: AF: Medium: The Communication Cost of Distributed Computation, Collaborative Research: AF: Medium: The Communication Cost of Distributed Computation, G7452299184