121 search results - page 16 / 25 » Load-Balanced Parallel Merge Sort on Distributed Memory Para... |
PPOPP
2009
ACM
14 years 9 months ago
2009
ACM
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...
ICPADS
2006
IEEE
14 years 2 months ago
2006
IEEE
—Recently, high-end reconfigurable computing systems that employ Field-Programmable Gate Arrays (FPGAs) as hardware accelerators for general-purpose processors have been built. T...
SIGMOD
2012
ACM
11 years 11 months ago
2012
ACM
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
We describe the implementation of an out-of-core, distribution-based sorting program on a cluster using FG, a multithreaded programming framework. FG mitigates latency from disk-I/...
ESA
2004
Springer
14 years 2 months ago
2004
Springer
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...