A parallel exchange sort algorithm
Behrooz Shirazi, Yufei Song · 2003
A parallel sorting algorithm is introduced which is based on the odd-even transposition (or exchange) sorting scheme. Compared to the parallel sorters of its class, the proposed algorithm requires about the same time complexity but reduces the number of processing elements in half. Using the VLSI measure of area*time/sup 2/, it is shown that this algorithm can outperform comparable parallel exchange sort algorithms. Due to its simple cell design and regular interconnections, the proposed sorter is highly suitable for VLSI implementation.>