Issue No. 05 - May (1993 vol. 4)

ISSN: 1045-9219

pp: 566-571

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.224219

ABSTRACT

<p>A balanced parallel algorithm to sort a sequence of items on a linear array of processors is presented. The length of the sequence may be small to arbitrarily large. For a shortsequence, the output of the sorted sequence begins at the step following the last inputof the whole sequence. For an arbitrarily long sequence, the time complexity is optimalunder realistic hardware conditions. A variation of the algorithm is also introduced. Bothalgorithms require far less local memory than that required by a different approach ofbalanced computation. Any number of balanced processors can be connected to delivermore computing power without increasing the memory size of each processor.</p>

INDEX TERMS

Index Termsbalanced parallel algorithm; linear array; local memory; balanced computation; computational complexity; parallel algorithms; sorting

CITATION

Y.C. Lin, "On Balancing Sorting on a Linear Array",

*IEEE Transactions on Parallel & Distributed Systems*, vol. 4, no. , pp. 566-571, May 1993, doi:10.1109/71.224219