Issue No. 11 - November (1998 vol. 47)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.736441
<p><b>Abstract</b>—We consider the problem of sorting on a one-dimensional subbus array of processors, an architecture that communicates using a segmentable bus. The subbus broadcast operation makes possible a new class of parallel sorting algorithms whose complexity we analyze with the <it>parallel insertion model</it>. We give per-input lower bounds for sorting in the parallel insertion model and demonstrate sorting strategies that are optimal by matching those lower bounds. For each of our sorting strategies, we discuss the issues involved in implementing them on subbus machines. Finally, we empirically evaluate the performance of our sorting strategies by applying them to shearsort, a common two-dimensional mesh sorting algorithm. Our results suggest that for sorting the subbus broadcast capability gives at most a slight advantage over using only nearest neighbor communication.</p>
Subbus array, sorting, parallel algorithms, lower bounds, segmented-bus architecture, reconfigurable mesh architecture, odd-even transposition sort, bubble sort.
R. E. Ladner and J. D. Fix, "Sorting by Parallel Insertion on a One-Dimensional Subbus Array," in IEEE Transactions on Computers, vol. 47, no. , pp. 1267-1281, 1998.