Sciweavers

57 search results - page 2 / 12
» An Optimal Parallel Algorithm for Sorting Multisets
Sort
View
IPPS
2005
IEEE
13 years 12 months ago
PDM Sorting Algorithms That Take A Small Number of Passes
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
Sanguthevar Rajasekaran, Sandeep Sen
IEEEPACT
2007
IEEE
14 years 19 days ago
AA-Sort: A New Parallel Sorting Algorithm for Multi-Core SIMD Processors
Many sorting algorithms have been studied in the past, but there are only a few algorithms that can effectively exploit both SIMD instructions and threadlevel parallelism. In this...
Hiroshi Inoue, Takao Moriyama, Hideaki Komatsu, To...
PPL
2006
134views more  PPL 2006»
13 years 6 months ago
A Cost Optimal Parallel Algorithm for Patience Sorting
Takaaki Nakashima, Akihiro Fujiwara
IPPS
2002
IEEE
13 years 11 months ago
On Cost-Optimal Merge of Two Intransitive Sorted Sequences
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...
Jie Wu, Stephan Olariu
IPPS
1999
IEEE
13 years 10 months ago
Reconfigurable Parallel Sorting and Load Balancing: HeteroSort
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...
Emmett Davis, Bonnie Holte Bennett, Bill Wren, Lin...