Skip to main content
SpringerLink
Log in

Faster sorting and routing on grids with diagonals

  • Conference paper
  • First Online:
STACS 94 (STACS 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 775))

Included in the following conference series:

Abstract

We study routing and sorting on grids with diagonal connections. We show that for so-called h-h problems faster solutions can be obtained than on comparable grids without diagonals. In most of the cases the number of transport steps for the new algorithms are less than half the on principle smallest number given by the bisection bound for grids without diagonals.

Work supported by the Deutsche Forschungsgemeinschaft, SFB 342, A4 “KLARA.”

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Kaklamanis and D. Krizanc. Optimal sorting on mesh-connected processor arrays. In Proc. of 3d SPAA, pages 50–59, 1992.

    Google Scholar 

  2. M. Kaufmann, S. Rajasekaran, and J. F. Sibeyn. Matching the bisection bound for routing and sorting on the mesh. In Proc. of 3d SPAA, pages 31–40, 1992.

    Google Scholar 

  3. M. Kaufmann and J. F. Sibeyn. Optimal k-k sorting on meshes and tori. 1993.

    Google Scholar 

  4. M. Kunde. Concentrated regular data streans on grids: Sorting and routing near to the bisection bound. In Proc. of 32d FOCS, pages 141–150, 1991.

    Google Scholar 

  5. M. Kunde. Block gossiping on grids and tori: Sorting and routing match the bisection bound deterministically. In Proc. of 1st ESA, volume 726 of Lecture Notes in Computer Science, pages 272–283, 1993.

    Google Scholar 

  6. H. T. Kung and C. E. Leiserson. Systolic arrays (for VLSI). In I. S. Duff and G. W. Stewart, editors, Sparse Matrix Proceedings 1978, pages 256–282. Society for Industrial and Applied Mathematics, 1979.

    Google Scholar 

  7. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.

    Google Scholar 

  8. T. Leighton, F. Makedon, and I. Tollis. A 2n — 2 step algorithm for routing in an n × n array with constant size queues. In Proc. of 1st SPAA, pages 328–335, 1989.

    Google Scholar 

  9. A. Park and K. Balasubramanian. Reducing communication costs for sorting on mesh-connected and linearly connected parallel computers. Journal of Parallel and Distributed Computing, 9:318–322, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik, Technische Universität München, Arcisstr. 21, 80290, München, Fed. Rep. of Germany

    Manfred Kunde, Rolf Niedermeier & Peter Rossmanith

Authors
  1. Manfred Kunde
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rolf Niedermeier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter Rossmanith
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Patrice Enjalbert Ernst W. Mayr Klaus W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kunde, M., Niedermeier, R., Rossmanith, P. (1994). Faster sorting and routing on grids with diagonals. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57785-8_144

Download citation

  • DOI: https://doi.org/10.1007/3-540-57785-8_144

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57785-0

  • Online ISBN: 978-3-540-48332-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation