Sciweavers

185 search results - page 1 / 37
» Parallel Sorting with Limited Bandwidth
Sort
View
88
Voted
SPAA
1995
ACM
15 years 1 months ago
Parallel Sorting with Limited Bandwidth
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
Micah Adler, John W. Byers, Richard M. Karp
94
Voted
EUROPAR
2008
Springer
15 years 6 hour 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
86
Voted
ARCS
2008
Springer
15 years 7 days ago
Hybrid Parallel Sort on the Cell Processor
: Sorting large data sets has always been an important application, and hence has been one of the benchmark applications on new parallel architectures. We present a parallel sortin...
Jörg Keller, Christoph W. Kessler, Kalle K&ou...
92
Voted
TJS
2010
145views more  TJS 2010»
14 years 5 months ago
Analyzing and enhancing the parallel sort operation on multithreaded architectures
The Sort operation is a core part of many critical applications. Despite the large efforts to parallelize it, the fact that it suffers from high data-dependencies vastly limits it...
Layali K. Rashid, Wessam Hassanein, Moustafa A. Ha...
83
Voted
IPPS
2006
IEEE
15 years 4 months ago
Optimizing bandwidth limited problems using one-sided communication and overlap
This paper demonstrates the one-sided communication used in languages like UPC can provide a significant performance advantage for bandwidth-limited applications. This is shown t...
Christian Bell, Dan Bonachea, Rajesh Nishtala, Kat...