@MISC{Meertens79bitonicsort, author = {Lambert Meertens}, title = {Bitonic Sort on Ultracomputers}, year = {1979} }

Share

OpenURL

Abstract

Batcher's bitonic sort (cf. Knuth, v. III, pp. 232 ff) is a sorting network, capable of sorting n inputs in Q((log n) 2 ) stages. When adapted to conventional computers, it gives rise to an algorithm that runs in time Q(n(log n) 2 ). The method can also be adapted to ultracomputers (Schwartz [1979]) to exploit their high degree of parallelism. The resulting algorithm will take time Q((log N) 2 ) for ultracomputers of "size" N. The implicit constant factor is low, so that even for moderate values of N the ultracomputer architecture performs faster than the Q(N log N) time conventional architecture can achieve. The purpose of this note is to describe the adapted algorithm. After some preliminaries a first version of the algorithm is given whose correctness is easily shown. Next, this algorithm is transformed to make it suitable for an ultracomputer. 1. Introduction Batcher's bitonic sort (cf. Knuth, v. III, pp. 232 ff) is a sorting network, capable of sorting n inputs in Q((log n...