Advertisement

Automatic mapping of parallel programs onto processor networks

  • Jürgen W. Meyer
Posters
Part of the Lecture Notes in Computer Science book series (LNCS, volume 634)

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

  1. 1.
    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, 1988Google Scholar
  2. 2.
    H. Shen, Occam Implementation of Process-to-Processor Mapping on the Hathi-2 Transputer System, Transputing '91, Proc. WOTUG, Sunnyvale, California, IOC Press, Amsterdam, 1991Google Scholar
  3. 3.
    E. Maehle, W. Obelöer, Monitoring-Werkzeuge zur Leistungsmessung in Multi-Transputersystemen, Proc. RISC '91, Karlsruhe, Germany, VDE-Verlag, Berlin, 1991Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Jürgen W. Meyer
    • 1
  1. 1.AB Technische Informatik 2Technische Universität Hamburg-Harburg HarburgerHamburg 90

Personalised recommendations