Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2006-07-10
Advances in Grid and Pervasive Computing (2006) 175-186
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
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. Such an application requires a partitioning step. For uniformly related processors (processors speeds are related by a constant factor), we develop a constant time technique for mastering processor load and execution time in an heterogeneous environment and also a technique to deal with unknown cost functions. For non uniformly related processors, we use a technique based on dynamic programming. Most of the time, the solutions are in O(p) (p is the number of processors), independent of the problem size n. Consequently, there is a small overhead regarding the problem we deal with but it is inherently limited by the knowing of time complexity of the portion of code following the partitioning.
Cérin Christophe
Dubacq Jean-Christophe
Roch Jean-Louis
the SafeScale Collaboration
No associations
LandOfFree
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-151748