A New Parallel Sorting Algorithm and its Efficient VLSI Implementation (1990)
In this paper we develop a new parallel algorithm for sorting which has a time complexity of O(log n) and requires n2/log n processors. The algorithm can be readily mapped on an SIMD mesh connected...