Abstract
This paper describes a mapping toolbox, whose aim is to optimize the execution time of parallel programs described as task graphs on distributed memory parallel systems. The toolbox includes several classical mapping algorithms. It was assessed by computing the mapping of randomly generated task graphs and by mapping and executing on a parallel system synthetic programs representing some classical numerical algorithms. A large number of experiments were used to validate the cost functions used in the toolbox and to compare the algorithms.
This work was partially sponsored by the EU's Copernicus programme under contract number CIPA-C193-0251
Chapter PDF
References
J. Błażewicz, P. Bouvry, D. Trystram, and R. Walkowiak. A tabu search algorithm for solving the mapping problem. 1995. European Conference on Combinatorial Optimization, ECCO'95.
S. W. Bollinger and S. F. Midkiff. Processor and link assignment in multicomputers using simulated annealing. In ICPP, 1988.
P. Bouvry, J.-P. Kitajima, B. Plateau, and D. Trystram. Andes: A performance evaluation tool, application to the mapping problem. submitted for publication.
T.L. Casavant and J.G. Kuhl. A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Transactions on Software Engineering, 1988.
F. Glover and M. Laguna. Tabu Search, a chapter in Modern Heuristic Techniques for Combinatorial Problems. W.H. Freeman, N-Y, 1992.
P. Haden and F. Berman. A comparative study of mapping algorithms for an automated parallel programming environment. Technical Report CS-088, UC San Diego, 1988.
J.G. Harp, C.R. Jesshope, T. Muntean, and C. Whitby-Stevens. The development and application of a low cost high performance multiprocessor machine. In ESPRIT'86: results and achievements, Amsterdam, 1986. North Holland.
J. Kitajima. Modèles Quantitatifs d'Algorithmes parallèles. PhD thesis, Institut National Polytechnique de Grenoble, Grenoble-France, November 1994. in french.
M. Norman and P. Thanish. Models of machines and computation for mapping in multicomputers. ACM Computing Surveys, September 1993.
B. Plateau. Présentation d'APACHE. Rapport APACHE 1, IMAG, Grenoble, October 1994. Available at ftp.imag.fr:/imag/APACHE/RAPPORTS.
T. Yang and A. Gerasoulis. PYRROS: static scheduling and code generation for message passing multiprocessors. In Proceedings of the 6th ACM International Conference on Supercomputing, pages 428–437. ACM, July 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouvry, P., de Kergommeaux, J.C., Trystram, D. (1995). Efficient solutions for mapping parallel programs. In: Haridi, S., Ali, K., Magnusson, P. (eds) EURO-PAR '95 Parallel Processing. Euro-Par 1995. Lecture Notes in Computer Science, vol 966. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020479
Download citation
DOI: https://doi.org/10.1007/BFb0020479
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60247-7
Online ISBN: 978-3-540-44769-6
eBook Packages: Springer Book Archive