TY - GEN
T1 - The round complexity of distributed sorting
T2 - 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'11, Held as Part of the 5th Federated Computing Research Conference, FCRC
AU - Patt-Shamir, Boaz
AU - Teplitsky, Marat
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
KW - communication complexity
KW - congest model
KW - distributed sorting
KW - network algorithms
UR - http://www.scopus.com/inward/record.url?scp=79959860533&partnerID=8YFLogxK
U2 - 10.1145/1993806.1993851
DO - 10.1145/1993806.1993851
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:79959860533
SN - 9781450307192
T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
SP - 249
EP - 255
BT - PODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing
Y2 - 6 June 2011 through 8 June 2011
ER -