TY - GEN
T1 - On the distributed complexity of large-scale graph computations
AU - Pandurangan, Gopal
AU - Robinson, Peter
AU - Scquizzato, Michele
N1 - Publisher Copyright:
© 2018 Copyright held by the owner/author(s).
PY - 2018/7/11
Y1 - 2018/7/11
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85051131123&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85051131123&partnerID=8YFLogxK
U2 - 10.1145/3210377.3210409
DO - 10.1145/3210377.3210409
M3 - Conference contribution
AN - SCOPUS:85051131123
T3 - Annual ACM Symposium on Parallelism in Algorithms and Architectures
SP - 405
EP - 414
BT - SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures
PB - Association for Computing Machinery
T2 - 30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018
Y2 - 16 July 2018 through 18 July 2018
ER -