Sciweavers

27 search results - page 1 / 6
» Methods for Partitioning Data to Improve Parallel Execution ...
Sort
View
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 4 months ago
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters
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...
Christophe Cérin, Jean-Christophe Dubacq, J...
SBACPAD
2004
IEEE
124views Hardware» more  SBACPAD 2004»
13 years 5 months ago
Improving Parallel Execution Time of Sorting on Heterogeneous Clusters
The aim of the paper is to introduce techniques in order to optimize the parallel execution time of sorting on heterogeneous platforms (processors speeds are related by a constant...
Christophe Cérin, Michel Koskas, Hazem Fkai...
ISHPC
2000
Springer
13 years 8 months ago
Partitioned Parallel Radix Sort
Partitioned parallel radix sort is a parallel radix sort that shortens the execution time by modifying the load balanced radix sort which is known one of the fastest internal sort...
Shin-Jae Lee, Minsoo Jeon, Andrew Sohn, Dongseung ...
CCGRID
2007
IEEE
13 years 10 months ago
A Simulation Study of Data Partitioning Algorithms for Multiple Clusters
Abstract— Recently we proposed algorithms for concurrent execution on multiple clusters [9]. In this case, data partitioning is done at two levels; first, the data is distribute...
Chen Yu, Dan C. Marinescu, Howard Jay Siegel, John...
CLUSTER
2006
IEEE
13 years 10 months ago
Matrix Multiplication on Two Interconnected Processors
This paper presents a new partitioning algorithm to perform matrix multiplication on two interconnected heterogeneous processors. Data is partitioned in a way which minimizes the ...
Brett A. Becker, Alexey L. Lastovetsky