Electronic Resource
Springer
The journal of supercomputing
3 (1989), S. 41-61
ISSN:
1573-0484
Keywords:
Sorting
;
hypercube multicomputers
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract This paper discusses sorting on a hypercube multicomputer, with the assumption that the data to be sorted is initially in the hypercube memory and the sorted data is to reside in the host memory. Three algorithms-heap-and-merge, cyclic merge, and embedded binary tree-are proposed. These are evaluated experimentally on an NCUBE/7 hypercube multicomputer. The cyclic merge algorithm is found to have the best performance.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00129647
Permalink
|
Location |
Call Number |
Expected |
Availability |