185 search results - page 3 / 37 » Parallel Sorting with Limited Bandwidth |
ASAP
2008
IEEE
14 years 7 days ago
2008
IEEE
We address the problem of data parallel processing for computational quantum chemistry (CQC). CQC is a computationally demanding tool to study the electronic structure of molecule...
PVG
2003
IEEE
13 years 11 months ago
2003
IEEE
While commodity computing and graphics hardware has increased in capacity and dropped in cost, it is still quite difficult to make effective use of such systems for general-purpos...
ISCAS
2008
IEEE
14 years 5 days ago
2008
IEEE
— Today’s implanted neural systems are bound by tight constraints on power and communication bandwidth. Most conventional ADC-based approaches fall into two categories. Either ...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
FOCS
1990
IEEE
13 years 9 months ago
1990
IEEE
We present several e cient algorithms for sorting on the uniform memory hierarchy UMH, introduced by Alpern, Carter, and Feig, and its parallelization P-UMH. We give optimal and ne...