Idiom Recognition in the Polaris Parallelizing Compiler

The elimination of induction variables and the parallelization of reductions in FORTRAN programs have been shown to be integral to performance improvement on parallel computers 7, 8]. As part of the Polaris project 5], compiler passes that recognize these idioms have been implemented and evaluated. Developing these techniques to the point necessary to achieve signi cant speedups on real applications has prompted solutions to problems that have not been addressed in previous reports on idiom recognition techniques. These include analysis techniques capable of disproving zero-trip loops, symbolic handling facilities to computeclosed forms of recurrences,and interfaces to other compilation passes such as the data-dependence test. In comparison, the recognitionphase of solving inductionvariables,which has receivedmostattentionso far, has in fact turnedout to be relatively straightforward. This paper provides an overview of techniques described in more detail in 12].

• Type: Conference
• Year: 1995
• Where: ICS
• Authors: William M. Pottenger, Rudolf Eigenmann
• Keywords: Compiler Passes, Distributed And Parallel Computing, ICS 1995, Idiom Recognition Techniques, Symbolic Handling Facilities