Optimal Mapping of a Parallel Application Processes onto Heterogeneous Platform

Authors:
Alexey Kalinov;Sergey Klimov
Affiliations:
Institute for System Programming of Russian Academy of Sciences, Russia;Institute for System Programming of Russian Academy of Sciences, Russia
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
Year:
2005

Citing 4
Cited 3

Heterogeneous distribution of computations solving linear algebra problems on networks of heterogeneous computers

Journal of Parallel and Distributed Computing
mpC + ScaLAPACK = Efficient Solving Linear Algebra Problems on Heterogeneous Networks

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Ten Reasons to Use Divisible Load Theory

Computer
Heuristics for Work Distribution of a Homogeneous Parallel Dynamic Programming Scheme on Heterogeneous Systems

ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks

A New Task Graph Model for Mapping Message Passing Applications

IEEE Transactions on Parallel and Distributed Systems
HeteroMPI+ScaLAPACK: towards a ScaLAPACK (dense linear solvers) on heterogeneous networks of computers

HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Column-Based matrix partitioning for parallel matrix multiplication on heterogeneous processors based on functional performance models

Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper is devoted to analysis of a strategy of computation distribution on heterogeneous parallel systems. According to this strategy processes of parallel program are distributed over the processors according to their performances and data are distributed between processes evenly. The paper presents an algorithm that computes optimal number of the processes and their distribution over processors minimizing the execution time of an application. The processor performance is considered as a function of the number of processes running on the processor and the amount of the data processing by the processor.