Showing papers on "Counting sort published in 1979"

Bitonic Sort on a Mesh-Connected Parallel Computer

Abstract: An O(n) algorithm to sort n2elements on an Illiac IV-like n × n mesh-connected processor array is presented. This algorithm sorts the n2elements into row-major order and is an adaptation of Batcher's bitonic sort. A slight modification of our algorithm yields an O(n) algorithm to sort n2elements into snake-like row-major order. Extensions to the case of a j-dimensional processor array are discussed.

Parallel Bitonic Record Sort - An Effective Algorithm for the Realization of a Post Processor.

Abstract: : A fast and parallel sorting algorithm is proposed The algorithm is an improvement over the bitonic sort This algorithm is particularly suitable for sorting records on the basis of field values of the records Furthermore, it lends itself effectively for the realization of a hardware sorter with multiple parallel processors and minimal interconnections among the processors

Two n-point fast walsh transform sorting algorithms

Abstract: An in-place reversible sorting algorithm is used following a fast Walsh transform to sort coefficients into increasing sals followed by decreasing cals. This separation of the coeffic ients into those arising from odd sinelike time functions and those from even cosinelike functions is useful in signal processing applications. A second sort routine generates a relocating set for a remap sequency sorting. To be valid for all N this sort routine is done out-of-place. The separation of the transform and sort functions has resulted in simple implementations for each. To demonstrate the differences in the sort routines, transform results and their inverses are made on a linear ramp. For this application the transform results with sal-cal sorting has all zeros beyond the mid-point showing that, with the exception of the large d.c. term, the linear ramp is composed entirely of Walsh odd time functions.