A Systolizing Compilation Scheme for Nested Loops with Linear Bounds

With the recent advances in massively parallel programmable processor networks, methods for the infusion of massive MIMD parallelism into programs have become increasingly relevant. We present a mechanical scheme for the synthesis of systolic programs from programs that do not specify concurrency or communication. The scheme can handle source programs that are perfectly nested loops with regular data dependences and that correspond to uniform recurrence equations. The target programs are in a machine-independent distributed language with asynchronous parallelism and synchronous communication. The scheme has been implemented as a prototype systolizing compiler.

• Type: Conference
• Year: 1993
• Where: MCMASTER
• Authors: Michael Barnett, Christian Lengauer
• Keywords: Massive Mimd Parallelism, MCMASTER 1993, Parallel Programmable Processor, Programming Languages, Systolic Programs