121 search results - page 13 / 25 » Load-Balanced Parallel Merge Sort on Distributed Memory Para... |
121
Voted
HPCC
2007
Springer
15 years 8 months ago
2007
Springer
Computing ”in-place and in-order”FFT poses a very difficult problem on hierarchical memory architectures where data movement can seriously degrade the performance. In this pape...
107
Voted
HPDC
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
133
click to vote
MST
2002
15 years 1 months ago
2002
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
115
click to vote
SPAA
1995
ACM
15 years 5 months ago
1995
ACM
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...