Sorting within distance bound on a mesh-connected processor array
- 154 Downloads
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.
KeywordsVertical Strip Sorting Algorithm Processor Array Respective Probability Algorithm Nest
Unable to display preview. Download preview PDF.
- B.S. Chlebus, and M. Kukawka, A guide to sorting on mesh-connected processor arrays, Computers and Artificial Intelligence, to appear.Google Scholar
- T. Hagerup, and C. Rüb, A guided tour of Chernoff bounds, report, 1989.Google Scholar
- 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
- Y. Han, Y. Igarashi, and M. Truszczynski, Indexing schemes and lower bounds for sorting on a mesh-connected computer, report, 1988.Google Scholar
- 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
- 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
- C.P. Schnorr, and A. Shamir, An optimal sorting algorithm for mesh-connected computers, Proceedings STOC 1986, pp.255–263.Google Scholar