Program Configuration for Massively Parallel Computers

Many heuristics have been created to solve the mapping problem. This contribution presents an integration of a set of mapping heuristics into a program development system, such that mapping becomes an automatic step of program generation. This is achieved by designing a flexible interface to mapping heuristics and by introducing a new method of generating the process graph using runtime-monitoring. 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. It 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