A bridging model for parallel computation
Communications of the ACM
Parallel randomized load balancing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Communication-efficient parallel sorting (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
LogP: a practical model of parallel computation
Communications of the ACM
Balls and bins: a study in negative dependence
Random Structures & Algorithms
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
SIAM Journal on Computing
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
SIAM Journal on Computing
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
A Note on Distributed Stable Matching
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Brief announcement: exponential speed-up of local algorithms using non-local communication
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Tight bounds for parallel randomized load balancing: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
Super-fast distributed algorithms for metric facility location
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
"Tri, tri again": finding triangles and small subgraphs in a distributed setting
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Optimal deterministic routing and sorting on the congested clique
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We consider the model of fully connected networks, where in each round each node can send an O(log n)-bit message to each other node (this is the CONGEST model with diameter 1). It is known that in this model, min-weight spanning trees can be found in O(log log n) rounds. In this paper we show that distributed sorting, where each node has at most n items, can be done in time O(log log n) as well. It is also shown that selection can be done in O(1) time. (Using a concurrent result by Lenzen and Wattenhofer, the complexity of sorting is further reduced to constant.) Our algorithms are randomized, and the stated complexity bounds hold with high probability.