Generation of Distributed Supervisors for Parallel Compilers

This paper presents a new approach towards solving the combination and communication problems between different compiler tasks. As optimizations may generate as well as destroy application conditions of other tasks a carefully chosen application order is important for the effectiveness of the compiler system. Each task is solved by exactly one implementation (engine) and is characterized by its input-output behaviour and an optional heuristics. The specification of all tasks in this manner allows the generation of distributed supervisors for the whole compilation system. The result is a clear semantics of the compiler be-haviour during compilation and the separation of algorithm and communication. Software engineering advantages are the easy integration of independently devel-oped parts and the reusability of code. The flexibility of such a compiler system results ill high portability even across hardware architectures and topologies. IFuoded by the ESPRIT Project #5399 (COMPARE