Abstract
Shearsort is a classical sorting algorithm working in rounds on 2-dimensional meshes of processors. Its elementary and elegant runtime analysis can be found in various textbooks. There is a straightforward generalization of Shearsort to multi-dimensional meshes. As experiments turn out, it works fast. However, no method has yet been shown strong enough to provide a tight analysis of this algorithm. In this paper, we present an analysis of the 3-dimensional case and show that on the l x l x l-mesh, it suffices to perform 21ogl+ 10 rounds while 2logl+1 rounds are necessary. Moreover, tools for analyzing multi-dimensional Shearsort are provided.
Supported by KBN grants 2 1197 91 01 and 8 5503 002 07, DFG grant Di 412/2-1, and by Volkswagen- Stiftung, a part of this work has been done when this author was affiliated with Computer Science Institute, University of Wroclaw, Poland.
Supported by DFG-SFB 376 "Massive Parallelitat," by EU ESPRIT Project 20244 (ALCOM-IT), and by DFG Leibniz Grant Me 872/6-1. Currently on leave to the International Computer Science Institute (ICSI) at Berkeley, USA.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. E. Batcher. Sorting networks and their applications. In AFIPS Conf Proc. 32, pp. 307–314, 1968.
K. Brockmann and R. Wanka. Efficient oblivious parallel sorting on the MasPar MP-l. In Proc. 30th IEEE HICSS, Vol. 1, pp. 200–208, 1997.
P. F. Corbett and I. D. Scherson. Sorting in mesh connected multiprocessors. IEEE Trans. Parallel and Distributed Systems 3 (1992) 626–632.
M. Dowd, Y. Perl, M. Saks, and L. Rudolph. The periodic balanced sorting network. J. ACM 36 (1989) 738–757.
D. E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching (Addison-Wesley, Reading, 1973).
M. Kunde. Optimal sorting on multi-dimensionally mesh-connected computers. In Proc. 4th STACS, pp. 408–419, 1987.
F. T Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (Morgan Kaufmann, San Mateo, 1992).
C. G. Plaxton. A hypercubic network with nearly logarithmic depth. In Proc. 24th ACM STOC, pp. 405–416, 1992.
I. D. Scherson and S. Sen. Parallel sorting in two-dimensional VLSI models of computation, IEEE Trans. Comput. 38 (1989) 238–249.
I. D. Scherson, S. Sen, and A. Shamir. Shear-sort: A true two-dimensional sorting technique for VLSI networks, in Proc. 15th IEEE ICPP, 1986, pp. 903–908.
C. P. Schnorr and A. Shamir. An optimal sorting algorithm for mesh-connected computers. In Proc. 18th ACM STOC, pp. 255–263, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kutyłowski, M., Wanka, R. (1997). Playing tetris on meshes and multi-dimensional Shearsort . In: Leong, H.W., Imai, H., Jain, S. (eds) Algorithms and Computation. ISAAC 1997. Lecture Notes in Computer Science, vol 1350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63890-3_5
Download citation
DOI: https://doi.org/10.1007/3-540-63890-3_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63890-2
Online ISBN: 978-3-540-69662-9
eBook Packages: Springer Book Archive