On the distributed complexity of large-scale graph computations

Gopal Pandurangan, Peter Robinson, Michele Scquizzato

Research output: Chapter in Book/Report/Conference proceedingConference contribution

34 Scopus citations

Abstract

Motivated by the increasing need to understand the distributed algorithmic foundations of large-scale graph computations, we study some fundamental graph problems in a message-passing model for distributed computing where k 2 machines jointly perform computations on graphs with n nodes (typically, n ≫ k). The input graph is assumed to be initially randomly partitioned among the k machines, a common implementation in many real-world systems. Communication is point-to-point, and the goal is to minimize the number of communication rounds of the computation.

Original languageEnglish (US)
Title of host publicationSPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures
PublisherAssociation for Computing Machinery
Pages405-414
Number of pages10
ISBN (Electronic)9781450357999
DOIs
StatePublished - Jul 11 2018
Externally publishedYes
Event30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018 - Vienna, Austria
Duration: Jul 16 2018Jul 18 2018

Publication series

NameAnnual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018
Country/TerritoryAustria
CityVienna
Period7/16/187/18/18

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'On the distributed complexity of large-scale graph computations'. Together they form a unique fingerprint.

Cite this