Abstract
We study the bit complexity of the sorting problem for asynchronous distributed systems. We show that for every network with a tree topology T, every sorting algorithm must send at least Ω(Δ T log L/N) bits in the worst case, where {0, 1, ..., L} is the set of possible initial values, and Δ T is the sum of distances from all the vertices to a median of the tree. In addition, we present an algorithm that sends at most O(Δ T log L N/Δ T) bits for such trees; These bounds are tight if either L=Ω(N 1+ε) or Δ T =Ω(N 2). We also present results regarding average distributions. These results suggest that sorting is an inherently non-distributive problem, since it requires an amount of information transfer, that is equal to the concentration of all the data in a single processor, which then distributes the final results to the whole network. The importance of bit complexity — as opposed to message complexity — stems also from the fact that in the lower bound discussion, no assumptions are made as to the nature of the algorithm.
Preview
Unable to display preview. Download preview PDF.
References
J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, North-Holland, 1976.
R.G. Gallager, P.A. Humblet and P.M. Spira, A distributed algorithm for minimum spanning tree, ACM Trans. on Programming Languages and Systems, 5, 1, 1983, pp. 66–77.
O. Gerstel and S. Zaks, A new characterization of tree medians with applications to distributed algorithms, 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG92), Frankfurt, Germany, June 1992, Springer-Verlag LNCS 657, pp. 135–144.
E. Korach, D. Rotem and N. Santoro, Distributed algorithms for ranking the vertices of a network, Proceedings of the 13th Southeastern Conference on Combinatorics, Graph Theory and Computing, 1982, pp. 235–246.
M.C. Loui, The complexity of sorting in distributed systems, Information and Control, Vol. 60, 1–3, 1984, Vol. 60, 1–3, 1984, pp. 70–85.
S. Zaks, Optimal distributed algorithms for sorting and ranking, IEEE Trans. on Computers, c-34,4,April 1985, pp. 376–379.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gerstel, O., Zaks, S. (1993). The bit complexity of distributed sorting. In: Lengauer, T. (eds) Algorithms—ESA '93. ESA 1993. Lecture Notes in Computer Science, vol 726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57273-2_54
Download citation
DOI: https://doi.org/10.1007/3-540-57273-2_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57273-2
Online ISBN: 978-3-540-48032-7
eBook Packages: Springer Book Archive