Wednesday, April 25, 2018 - 12:00pm to 1:00pm
Location:ASA Conference Room 6115 Gates Hillman Centers
Speaker:D. ELLIS HERSHKOWITZ, Ph.D. Student http://www.cs.cmu.edu/~dhershko/
Distributed graph algorithms that separately optimize for either the number of rounds used or the total number of messages sent have been studied extensively. However, algorithms simultaneously efficient with respect to both measures have been elusive. For example, only very recently was it shown that for Minimum Spanning Tree (MST), an optimal message and round complexity is achievable (up to polylog terms) by a single algorithm in the CONGEST model of communication.
We provide algorithms that are simultaneously round-optimal with near-linear message complexities for a number of well-studied distributed optimization problems. Our main result is such a distributed algorithm for the fundamental primitive of computing simple functions over each part of a graph partition. From this algorithm we derive round- and message-optimal algorithms for MST, Approximate Min-Cut and Approximate Single Source Shortest Paths. On general graphs all of our algorithms achieve worst-case optimal Õ(D + √n) round complexity and Õ(m) message complexity. Furthermore, our algorithms require optimal Õ(D) rounds and Õ(n) messages on planar, genus-bounded, treewidth-bounded and pathwidth-bounded graphs.
Presented in Partial Fulfillment of the CSD Speaking Skills Requirement