This paper presents a deterministic sorting algorithm, called Sharesort, that sorts n records on an n processor hypercube, shuffle-exchange or cube-connected cycles in O(log n(log log n) 2 ) time in the worst case. The algorithm requires only a constant amount of storage at each processor. The fastest previous deterministic algorithm for this problem was bitonic sort [3], which runs in O(log 2 n) time. 1 Introduction Given n records distributed uniformly over the n processors of some fixed interconnection network, the sorting problem is to route the record with the ith largest associated key to processor i, 0 i ! n. One of the earliest parallel sorting algorithms is Batcher's bitonic sort [3], which runs in O(log 2 n) time on the hypercube, shuffle-exchange (SE) [14] and cube-connected cycles (CCC) [11]. More recently, Leighton [6] exhibited a bounded-degree, O(log n) time sorting network based on the O(logn) depth sorting circuit of Ajtai, Koml'os and Szemer'edi [1]. Howe..
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.
