Sciweavers

100 search results - page 1 / 20
» A New Deterministic Parallel Sorting Algorithm with an Exper...
Sort
View
JEA
1998
133views more  JEA 1998»
13 years 4 months ago
A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation
We introduce a new deterministic parallel sorting algorithm based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communica...
David R. Helman, Joseph JáJá, David ...
CORR
2010
Springer
221views Education» more  CORR 2010»
13 years 4 months ago
Deterministic Sample Sort For GPUs
We present and evaluate GPU Bucket Sort, a parallel deterministic sample sort algorithm for many-core GPUs. Our method is considerably faster than Thrust Merge (Satish et.al., Pro...
Frank Dehne, Hamidreza Zaboli
EUROPAR
1997
Springer
13 years 9 months ago
Sample Sort on Meshes
In this paper various algorithms for sorting on processor networks are considered. We focus on meshes, but the results can be generalized easily to other decomposable architecture...
Jop F. Sibeyn
IEEEPACT
2007
IEEE
13 years 11 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...
ICALP
2010
Springer
13 years 6 months ago
Resource Oblivious Sorting on Multicores
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Richard Cole, Vijaya Ramachandran