Near-Constant-Time Distributed Algorithms on a Congested Clique

This paper presents constant-time and near-constant-time distributed algorithms for a variety of problems in the congested clique model. We show how to compute a 3-ruling set in expected O(logloglogn) rounds and using this, we obtain a constant-approximation to metric facility location, also in expected O(logloglogn) rounds. In addition, assuming an input metric space of constant doubling dimension, we obtain constant-round algorithms to compute constant-factor approximations to the minimum spanning tree and the metric facility location problems. These results significantly improve on the running time of the fastest known algorithms for these problems in the congested clique setting.

[1]  Roger Wattenhofer,et al.  Facility location: distributed approximation , 2005, PODC '05.

[2]  Sriram V. Pemmaraju,et al.  A Super-Fast Distributed Algorithm for Bipartite Metric Facility Location , 2013, DISC.

[3]  Andrew Berns,et al.  Super-Fast Distributed Algorithms for Metric Facility Location , 2012, ICALP.

[4]  Sriram V. Pemmaraju,et al.  Finding Facilities Fast , 2009, ICDCN.

[5]  Christoph Lenzen,et al.  Optimal deterministic routing and sorting on the congested clique , 2012, PODC '13.

[6]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[7]  Beat Gfeller,et al.  A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs , 2007, PODC '07.

[8]  Sriram V. Pemmaraju,et al.  Lessons from the Congested Clique Applied to MapReduce , 2014, SIROCCO.

[9]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[10]  Pierre Hansen,et al.  A Plant and Warehouse Location Problem , 1977 .

[11]  Christoph Lenzen,et al.  Brief announcement: exponential speed-up of local algorithms using non-local communication , 2010, PODC '10.

[12]  C. K. Jha,et al.  MapReduce: Simplified Data Analysis of Big Data , 2015 .

[13]  Aart J. C. Bik,et al.  Pregel: a system for large-scale graph processing , 2010, SIGMOD Conference.

[14]  Alessandro Panconesi,et al.  Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .

[15]  Sanjay Ghemawat,et al.  MapReduce: simplified data processing on large clusters , 2008, CACM.

[16]  Fabian Kuhn,et al.  On the power of the congested clique model , 2014, PODC.

[17]  Hartmut Klauck,et al.  The Distributed Complexity of Large-scale Graph Processing , 2013, ArXiv.

[18]  Roger Wattenhofer,et al.  On the locality of bounded growth , 2005, PODC '05.

[19]  Dorothea Wagner,et al.  Algorithms for Sensor and Ad Hoc Networks, Advanced Lectures [result from a Dagstuhl seminar] , 2007, Algorithms for Sensor and Ad Hoc Networks.

[20]  Said Salhi,et al.  Discrete Location Theory , 1991 .

[21]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[22]  Sriram V. Pemmaraju,et al.  Distributed Spanner Construction in Doubling Metric Spaces , 2006, OPODIS.

[23]  Sergei Vassilvitskii,et al.  A model of computation for MapReduce , 2010, SODA '10.

[24]  Roger Wattenhofer,et al.  A log-star distributed maximal independent set algorithm for growth-bounded graphs , 2008, PODC '08.

[25]  Joachim Gehweiler,et al.  A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem , 2006, SPAA '06.

[26]  Boaz Patt-Shamir,et al.  Distributed MST for constant diameter graphs , 2001, PODC '01.