Title

Do Hypercubes Sort Faster Than Tree Machines?

Author(s)/Creator(s)

Per Brinch Hansen, Syracuse University, School of Computer and Information ScienceFollow

Document Type

Report

Date

12-1991

Keywords

Parallel algorithms, Quicksort, Hypercube, Tree machine

Language

English

Disciplines

Computer Sciences

Description/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.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-91-44

Author later published: Hansen, P. B. (1994). Do hypercubes sort faster than tree machines? Concurrency: Practice and Experience, 6(2), 143-151. Wiley Blackwell (John Wiley & Sons). doi:10.1002/cpe.4330060205

Recommended Citation

Hansen, Per Brinch, "Do Hypercubes Sort Faster Than Tree Machines?" (1991). Electrical Engineering and Computer Science - Technical Reports. 132.
https://surface.syr.edu/eecs_techreports/132

Source

local