The round complexity of distributed sorting: Extended abstract

Boaz Patt-Shamir*, Marat Teplitsky

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationPODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing
Pages249-255
Number of pages7
DOIs
StatePublished - 2011
Event30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'11, Held as Part of the 5th Federated Computing Research Conference, FCRC - San Jose, CA, United States
Duration: 6 Jun 20118 Jun 2011

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'11, Held as Part of the 5th Federated Computing Research Conference, FCRC
Country/TerritoryUnited States
CitySan Jose, CA
Period6/06/118/06/11

Keywords

  • communication complexity
  • congest model
  • distributed sorting
  • network algorithms

Fingerprint

Dive into the research topics of 'The round complexity of distributed sorting: Extended abstract'. Together they form a unique fingerprint.

Cite this