Improved sorting networks withO(logN) depth

Abstract

The sorting network described by Ajtaiet al. was the first to achieve a depth ofO(logn). The networks introduced here are simplifications and improvements based strongly on their work. While the constants obtained for the depth bound still prevent the construction being of practical value, the structure of the presentation offers a convenient basis for further development.

Key words

Sorting networks Comparators Parallel algorithm

The author was supported by a Senior Fellowship from the Science and Engineering Research Council during the course of this work.