Abstract
Many heuristics have been created to solve the mapping problem. A set of mapping heuristics has been integrated into a program development system, such that mapping becomes an automatic step of program generation. The system serves as a basis for development, analysis, and comparison of mapping heuristics as well as as program development tool with selectable mapping heuristics for program configuration.
The system is implemented on a flexible transputer based parallel computer, which is able to emulate a large variety of problems for mapping heuristics. Runtime monitoring of configured programs allows a detailed evaluation of mapping heuristics.
References
S. Antonelli, F. Baiardi, S. Pelagatti, M. Vanneschi, A Static Approach to Process Mapping in Massively Parallel Systems, in Parallel Processing, M. Cosnard, M.H. Barton, M. Vanneschi (Eds.), Elsevier Science Publishers, Amsterdam, 1988
H. Shen, Occam Implementation of Process-to-Processor Mapping on the Hathi-2 Transputer System, Transputing '91, Proc. WOTUG, Sunnyvale, California, IOC Press, Amsterdam, 1991
E. Maehle, W. Obelöer, Monitoring-Werkzeuge zur Leistungsmessung in Multi-Transputersystemen, Proc. RISC '91, Karlsruhe, Germany, VDE-Verlag, Berlin, 1991
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meyer, J.W. (1992). Automatic mapping of parallel programs onto processor networks. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_507
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_507
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive