121 search results - page 17 / 25 » Load-Balanced Parallel Merge Sort on Distributed Memory Para... |
136
Voted
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
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...
144
click to vote
SC
2003
ACM
15 years 7 months ago
2003
ACM
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participa...
105
Voted
JACM
2006
15 years 2 months ago
2006
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
117
click to vote
JPDC
2006
15 years 2 months ago
2006
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participati...
118
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...