Previous research work on parallel sorting and merging is reviewed. The topics covered include: paralel straight insertion sort, odd-even transposition sort, odd-even merge sorting, bitonic merge sorting, min-mid- max merge sorting, k-sorter sorting, implementations of Bather's algorithms on the multiprocessor system, and perfect shuffle and bitonic sorting. Also addressed are: parallel sorting algorithms implemented on the linear- connected computer and mesh-connected computer, the Boolean lattice and Diamond sort, duodirun merging, Valiant's algorithm, the parallel insertion sort, the parallel enumeration sort, the parallel bucket sort, and sorting by VLSI technology.
