Sciweavers

78 search results - page 4 / 16
» Optimizing Parallel Bitonic Sort
Sort
View
IPPS
2005
IEEE
14 years 1 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 1 months 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...
IPPS
2000
IEEE
13 years 12 months ago
On Sorting an Intransitive Total Ordered Set Using Semi-Heap
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
Jie Wu
EUROPAR
2008
Springer
13 years 9 months ago
Optimized Pipelined Parallel Merge Sort on the Cell BE
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...
Jörg Keller, Christoph W. Kessler