Book chapter
Near-Constant-Time Distributed Algorithms on a Congested Clique
Distributed Computing, pp.514-530
Lecture Notes in Computer Science, Springer Berlin Heidelberg
2014
DOI: 10.1007/978-3-662-45174-8_35
Abstract
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.
Details
- Title: Subtitle
- Near-Constant-Time Distributed Algorithms on a Congested Clique
- Creators
- James W. Hegeman - University of IowaSriram V. Pemmaraju - University of IowaVivek B. Sardeshmukh - University of Iowa
- Resource Type
- Book chapter
- Publication Details
- Distributed Computing, pp.514-530
- Publisher
- Springer Berlin Heidelberg; Berlin, Heidelberg
- Series
- Lecture Notes in Computer Science
- DOI
- 10.1007/978-3-662-45174-8_35
- eISSN
- 1611-3349
- ISSN
- 0302-9743
- Language
- English
- Date published
- 2014
- Academic Unit
- Computer Science
- Record Identifier
- 9984259433302771
Metrics
2 Record Views