Towards the automatic optimal mapping of pipeline algorithms

Authors:
D. González;F. Almeida;L. Moreno;C. Rodríguez
Affiliations:
Dpto. Estadistica, I. O. y Computación, Universidad de La Laguna, La Laguna, Tenerife, Spain;Dpto. Estadistica, I. O. y Computación, Universidad de La Laguna, La Laguna, Tenerife, Spain;Dpto. Estadistica, I. O. y Computación, Universidad de La Laguna, La Laguna, Tenerife, Spain;Dpto. Estadistica, I. O. y Computación, Universidad de La Laguna, La Laguna, Tenerife, Spain
Venue:
Parallel Computing
Year:
2003

Citing 9
Cited 6

Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays

IEEE Transactions on Computers
Tiling multidimensional iteration spaces for nonshared memory machines

Proceedings of the 1991 ACM/IEEE conference on Supercomputing
A methodology for the development and the support of massively parallel programs

Future Generation Computer Systems - Special triple issue: parallel and distributed workstation systems
Numerical recipes in C (2nd ed.): the art of scientific computing

Numerical recipes in C (2nd ed.): the art of scientific computing
LogP: towards a realistic model of parallel computation

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Integral knapsack problems: parallel algorithms and their implementations on distributed systems

ICS '95 Proceedings of the 9th international conference on Supercomputing
Optimal semi-oblique tiling

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Skeletons for Data Parallelism in p3l

Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Exploiting Advanced Task Parallelism in High Performance Fortran via a Task Library

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing

Heuristics for work distribution of a homogeneous parallel dynamic programming scheme on heterogeneous systems

Parallel Computing - Heterogeneous computing
Efficient parallel LAN/WAN algorithms for optimization: the MALLBA project

Parallel Computing
Efficient parallel LAN/WAN algorithms for optimization. The mallba project

Parallel Computing
Feedback-directed pipeline parallelism

Proceedings of the 19th international conference on Parallel architectures and compilation techniques
Towards fully adaptive pipeline parallelism for heterogeneous distributed environments

ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
A framework for the application of metaheuristics to tasks-to-processors assignation problems

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The assignment of computations to processors is a crucial factor determining the effectiveness of a parallel algorithm. The portability of parallel programs has involved lot of effort during the last decade. However, the performance of a parallel code suffers, in many cases, from inherent effects of the target architectures. The optimal mapping of a parallel program is strongly dependent on the granularity and network architecture. We focus on the problem of finding the optimal mapping of pipeline algorithms on a ring of processors. We propose an analytical model that allows an easy estimation of the parameters needed to obtain the mapping. The model can be introduced in a suitable tool to automatically produce this mapping. Both the accuracy of the model and the optimal efficiency of the algorithm found are contrasted on pipeline algorithms for the knapsack problem, for the resource allocation problem and for the path planning problem.