Abstract
We present sorting algorithms on the recently introduced multi-mesh, a network consisting of n 2 meshes of size n x n which are connected by the free marginal links of the meshes. Our algorithm takes 41n + o(n) steps which is a significant improvement to previously known algorithms. The sorting algorithm is based on a technique using interchange of data between the n x n submeshes to distribute information uniformly, an approach which is similar to an all-to-all mapping. Furthermore, with this approach we can also handle k-k problems on the multi-mesh, where each processor contains k elements initially and finally. We show that the k-k sorting problem can be solved in about 9.5kn steps, provided k ≥ 12.
This research is supported by the DFG-Project Ku 658/8-1
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Das and B. P. Sinha. Multi-mesh: An efficient topology for parallel processing. In Proceedings of the 9th International Symposium on Parallel Processing (IPPS'95), pages 17–21. IEEE Computer Society Press, April 1995.
M. De, D. Das, M. Ghosh, and B. P. Sinha. An efficient sorting algorithm on the multi-mesh network. In HiPC '95: International Conference on High Performance Computing, pages 707–712. McGraw-Hill, December 1995.
D. Knuth. The Art of Computer Programming, Vol. III: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.
M. Kunde. Block gossiping on grids and tori: Deterministic sorting and routing match the bisection bound. In T. Lengauer, editor, First Annual European Symposium (ESA'93), pages 272–283. LNCS 726. Springer-Verlag, September 30–October 2, 1993.
M. Kunde. Packet routing on grids of processors. Algorithmica, 9(1):32–46, 1993.
F. T. Leighton. Introduction to Parallel Algorithms and Architectures. Morgan Kaufman, San Mateo, 1992.
I. Scherson and S. Sen. Parallel sorting in two-dimensional VLSI models of computation. IEEE Transactions on Computers, 38(2):238–249, [2] 1989.
C. P. Schnorr and A. Shamir. An optimal sorting algorithm for mesh connected computers. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pages 255–263, Berkeley, California, 28–30 May 1986.
J. F. Sibeyn. Desnakification of mesh sorting algorithms. In J. van Leeuwen, editor, Second Annual European Symposium (ESA'94), pages 377–390. LNCS 855. Springer-Verlag, September 26–28 1994.
J. F. Sibeyn. Overview of mesh results. Technical Report MPI-I-95-1-018, Max-Planck-Institut für Informatik, Saarbrücken, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avermiddig, A., Kunde, M., Osterloh, A. (1997). k-k Sorting on the multi-mesh. In: Chlebus, B.S., Czaja, L. (eds) Fundamentals of Computation Theory. FCT 1997. Lecture Notes in Computer Science, vol 1279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036174
Download citation
DOI: https://doi.org/10.1007/BFb0036174
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63386-0
Online ISBN: 978-3-540-69529-5
eBook Packages: Springer Book Archive