78 search results - page 3 / 16 » Optimizing Parallel Bitonic Sort |
SPAA
1997
ACM
13 years 11 months ago
1997
ACM
- Multithreading aims to tolerate latency by overlapping communication with computation. This report explicates the multithreading capabilities of the EM-X distributed-memory multi...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
HeteroSort load balances and sorts within static or dynamic networks. Upon failure of a node or path, HeteroSort uses a genetic algorithm to minimize the distribution path by optim...
PARLE
1991
13 years 11 months ago
1991
IPPS
2002
IEEE
14 years 11 days ago
2002
IEEE
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...