Parallel algorithms, Quicksort, Hypercube, Tree machine
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.
Hansen, Per Brinch, "Do Hypercubes Sort Faster Than Tree Machines?" (1991). Electrical Engineering and Computer Science Technical Reports. 132.