Sciweavers

611 search results - page 2 / 123
» Highly scalable parallel sorting
Sort
View
IPPS
2010
IEEE
13 years 4 months ago
High performance comparison-based sorting algorithm on many-core GPUs
Xiaochun Ye, Dongrui Fan, Wei Lin, Nan Yuan, Paolo...
LCR
2000
Springer
172views System Software» more  LCR 2000»
13 years 10 months ago
Achieving Robust, Scalable Cluster I/O in Java
We present Tigris, a high-performance computation and I/O substrate for clusters of workstations that is implemented entirely in Java. Tigris automatically balances resource load a...
Matt Welsh, David E. Culler
IEEEPACT
2007
IEEE
14 years 20 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...

Publication
189views
13 years 10 months ago
Direct Send Compositing for Parallel Sort-Last Rendering
In contrast to sort-first, sort-last parallel rendering has the distinct advantage that the task division for parallel geometry processing and rasterization is simple, and can eas...
Stefan Eilemann, Renato Pajarola
SIGMOD
1997
ACM
135views Database» more  SIGMOD 1997»
13 years 10 months ago
High-Performance Sorting on Networks of Workstations
We report the performance of NOW-Sort, a collection of sorting implementations on a Network of Workstations (NOW). We find that parallel sorting on a NOW is competitive to sortin...
Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau,...