Skip to main content
SpringerLink
Log in

Sorting within distance bound on a mesh-connected processor array

  • Conference paper
  • First Online:
Optimal Algorithms (OA 1989)

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

Included in the following conference series:

Abstract

An algorithm is developed which sorts random sequences of keys on the n × n square mesh in the expected time 2n. The algorithm is shown to be optimal, that is, the matching Ω(2n) lower bound on the expected-time of algorithms sorting randomly ordered inputs is proved.

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. D. Angluin, and L.G. Valiant, Fast probabilistic algorithms for Hamiltanian circuits and matchings, J. Comput. System Sci. 18 (1979) 155–193.

    Article  Google Scholar 

  2. B.S. Chlebus, and M. Kukawka, A guide to sorting on mesh-connected processor arrays, Computers and Artificial Intelligence, to appear.

    Google Scholar 

  3. T. Hagerup, and C. Rüb, A guided tour of Chernoff bounds, report, 1989.

    Google Scholar 

  4. Y. Han, and Y. Igarashi, Time lower bounds for parallel sorting on a mesh connected processor array, Proceedings AWOC'88, pp. 434–439.

    Google Scholar 

  5. Y. Han, Y. Igarashi, and M. Truszczynski, Indexing schemes and lower bounds for sorting on a mesh-connected computer, report, 1988.

    Google Scholar 

  6. M. Kunde, Bounds for l-selection and related problems on grids of processors, Proceedings Parcella'88, Akademie-Verlag, Berlin, 1988, pp. 298–307.

    Google Scholar 

  7. M. Kunde, Lower bounds for sorting on mesh-connected architectures, Acta Informatica 24 (1987) 121–130.

    MathSciNet  Google Scholar 

  8. Y. Ma, S. Sen, and I.D. Scherson, The distance bound for sorting on mesh connected processor arrays is tight, Proceedings FOCS 1986, pp. 255–263.

    Google Scholar 

  9. C.P. Schnorr, and A. Shamir, An optimal sorting algorithm for mesh-connected computers, Proceedings STOC 1986, pp.255–263.

    Google Scholar 

  10. C.D. Thompson, and H.T. Kung, Sorting on a mesh connected parallel computer, Comm. ACM 20 (1977) 263–271.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instytut Informatyki, Uniwersytet Warszawski PKiN, p. 850, 00-901, Warszawa, Poland

    Bogdan S. Chlebus

Authors
  1. Bogdan S. Chlebus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hristo Djidjev

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chlebus, B.S. (1989). Sorting within distance bound on a mesh-connected processor array. In: Djidjev, H. (eds) Optimal Algorithms. OA 1989. Lecture Notes in Computer Science, vol 401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51859-2_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-51859-2_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51859-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation