Advertisement

Sorting within distance bound on a mesh-connected processor array

  • Bogdan S. Chlebus
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 401)

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.

Keywords

Vertical Strip Sorting Algorithm Processor Array Respective Probability Algorithm Nest 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    D. Angluin, and L.G. Valiant, Fast probabilistic algorithms for Hamiltanian circuits and matchings, J. Comput. System Sci. 18 (1979) 155–193.CrossRefGoogle Scholar
  2. [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. [3]
    T. Hagerup, and C. Rüb, A guided tour of Chernoff bounds, report, 1989.Google Scholar
  4. [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. [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. [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. [7]
    M. Kunde, Lower bounds for sorting on mesh-connected architectures, Acta Informatica 24 (1987) 121–130.MathSciNetGoogle Scholar
  8. [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. [9]
    C.P. Schnorr, and A. Shamir, An optimal sorting algorithm for mesh-connected computers, Proceedings STOC 1986, pp.255–263.Google Scholar
  10. [10]
    C.D. Thompson, and H.T. Kung, Sorting on a mesh connected parallel computer, Comm. ACM 20 (1977) 263–271.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Bogdan S. Chlebus
    • 1
  1. 1.Instytut InformatykiUniwersytet Warszawski PKiNWarszawaPoland

Personalised recommendations