Playing tetris on meshes and multi-dimensional Shearsort

  • Miroslaw Kutyłowski
  • Rolf Wanka
Session 2A

DOI: 10.1007/3-540-63890-3_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1350)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Miroslaw Kutyłowski
    • 1
  • Rolf Wanka
    • 1
  1. 1.Heinz Nixdorf Institute and Dept. of Mathematics & Computer SciencePaderborn UniversityPaderbornGermany

Personalised recommendations