Naga Ayachitula, Melissa Buco, et al.
SCC 2007
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 Batcher's bitonic sort, which runs in O(log2 n) time. © 1993.
Naga Ayachitula, Melissa Buco, et al.
SCC 2007
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
J. LaRue, C. Ting
Proceedings of SPIE 1989