Open AccessDo hypercubes sort faster than tree machines?
Author(s) -
Hansen Per Brinch
Publication year - 1994
Publication title -
concurrency: practice and experience
Language(s) - English
Resource type - Journals
eISSN - 1096-9128
pISSN - 1040-3108
DOI - 10.1002/cpe.4330060205
Subject(s) - hypercube , binary tree , computer science , quicksort , tree (set theory) , sort , parallel computing , sorting , algorithm , theoretical computer science , sorting algorithm , mathematics , combinatorics , database
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom