Fast Parallel Sorts on a Practical Sized Mesh-Connected Processor Array

Yoshihide IGARASHI, Kazuhiro SADO, Koji SAGA

  • Full Text Views

    13

  • Cite this

Summary :

We show some properties of the parallel bubble sort and propose three parallel sorting algorithms on the mesh-connected processor array. These algorithms are some combinations of the parallel bubble sorts in different directions. The hardware structure and control for these algorithms are simple. These abgorithms seem to be asymptotically slower than O()-time parallel sorting algorithms. However, our computer experiments show that two of our abgorithms are faster on the average than any known algorithm on the mesh-connected model for N16384.

Publication
IEICE TRANSACTIONS on transactions Vol.E70-E No.1 pp.56-64
Publication Date
1987/01/25
Publicized
Online ISSN
DOI
Type of Manuscript
PAPER
Category
Algorithm, Computational Complexity

Authors

Keyword

FlyerIEICE has prepared a flyer regarding multilingual services. Please use the one in your native language.