Do hypercubes sort faster than tree machines?
Per Brinch Hansen · Concurrency Practice and Experience · 1994
Abstract We develop a balanced, parallel quicksort algorithm for a hypercube and compare it with a similar algorithm for a binary tree machine. The performance of the hypercube algorithm is measured on a Computing Surface.