Abstract
We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then we asymptotically halve the up to now best running times. For a load of one optimal algorithms are known for the mesh. We improve this to a load of eight without increasing the running time. For tori no optimal algorithms were known even for a load of one. Our algorithm is optimal for every load. Other architectures we consider include meshes with diagonals and reconfigurable meshes. Furthermore, the method applies to meshes of arbitrary higher dimensions and also enables optimal solutions for the routing problem.
This research was supported by the Deutsche Forschungsgemeinschaft, Sonderforschungsbereich 0342, TP A4 “KLARA.”
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. S. Chlebus. Sorting within distance bound on a mesh-connected processor array. In H. Djidjev, editor, Proc. of International Symposium on Optimal Algorithms, Number 401 in Lecture Notes in Computer Science, pages 232–238, Varna, Bulgaria, May/June 1989. Springer.
W. Feller. An Introduction to Probability Theory and its Applications, volume I. Wiley, 3d edition, 1968.
Q. P. Gu and J. Gu. Algorithms and average time bounds of sorting on a meshconnected computer. IEEE Transactions on Parallel and Distributed Systems, 5(3):308–315, March 1994.
T. Hagerup and C. Rüb. A guided tour of Chernoff bounds. Information Processing Letters, 33:305–308, 1990.
M. Hofri. Probabilistic analysis of algorithms. Texts and Monographs in Computer Science. Springer-Verlag, 1987.
M. Kaufmann, H. Schröder, and J. F. Sibeyn. Routing and sorting on reconfigurable meshes. 1994. To appear in Parallel Processing Letters.
M. Kaufmann, J. F. Sibeyn, and T. Suel. Derandomizing algorithms for routing and sorting on meshes. In Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, pages 669–679, 1994.
D. E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison-Wesley, 2nd edition, 1969.
D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, 1973.
M. Kunde. Block gossiping on grids and tori: Sorting and routing match the bisection bound deterministically. In T. Lengauer, editor, Proceedings of the 1st European Symposium on Algorithms, Number 726 in Lecture Notes in Computer Science, pages 272–283, Bad Honnef, Federal Republic of Germany, September 1993. Springer.
M. Kunde, R. Niedermeier, and P. Rossmanith. Faster sorting and routing on grids with diagonals. In P. Enjalbert, E. W. Mayr, and K. W. Wagner, editors, Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, pages 225–236. Springer, 1994.
T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.
T. Leighton. Methods for message routing in parallel machines. In Proceedings of the 24th ACM Symposium on Theory of Computing, pages 77–96, 1992.
R. Miller, V. K. Prasanna-Kumar, D. I. Reisis, and Q. F. Stout. Parallel computation on reconfigurable meshes. IEEE Transactions on Computers, 42(6):678–692, June 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kunde, M., Niedermeier, R., Reinhardt, K., Rossmanith, P. (1995). Optimal average case sorting on arrays. In: Mayr, E.W., Puech, C. (eds) STACS 95. STACS 1995. Lecture Notes in Computer Science, vol 900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_100
Download citation
DOI: https://doi.org/10.1007/3-540-59042-0_100
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59042-2
Online ISBN: 978-3-540-49175-0
eBook Packages: Springer Book Archive