A New Model for Static Mapping of Parallel Applications with Task and Data Parallelism

Authors:
Concepció Roig;Ana Ripoll;Miquel A. Senar;Fernando Guirado;Emilio Luque
Affiliations:
-;-;-;-;-
Venue:
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Year:
2002

Citing 5
Cited 1

Scheduling precedence graphs in systems with interprocessor communication times

SIAM Journal on Computing
Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
Monitoring parallel programs for performance tuning in cluster environments

Parallel program development for cluster computing
Exploiting Knowledge of Temporal Behaviour in Parallel Programs for Improving Distributed Mapping

Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Clustering and Reassignment-Based Mapping Strategy for Message-Passing Architectures

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium

AMEEDA: A General-Purpose Mapping Tool for Parallel Applications on Dedicated Clusters (Research Note)

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The efficient mapping of parallel tasks is essential in order to exploit the gain from parallelisation. In this work, we focus on modelling and mapping message-passing applications that are defined by the programmer with an arbitrary interaction pattern among tasks. A new model is proposed, known as TTIG (Temporal Task Interaction Graph), which captures not only computation and communication costs, but also the percentages of concurrency between tasks. From this model, a mapping strategy is developed that minimises expected execution time by properly exploiting task parallelism. The effectiveness of this approach has been proven for a real image-processing application on a cluster of PCs.