Solving the Mapping Problem - Experiences with a Genetic Algorithm

The specific problem to solve was the mapping of asynchronous cooperating processes (UNITY statements) to an arbitrary parallel architecture. The algorithm should neither need any user interaction nor we would rely on heuristics. A (λ,μ)-evolution met our intentions and has been implemented in Modula-P. A locally working optimizer lead to good mapping solutions.