Validating more loop optimizations
but we have temporarily restricted your access to the Digital Library.Your activity appears to be coming from some type of automated process.
This paper also discusses preliminary work on run-time validation of speculative loop optimizations.This involves using run-time tests to ensure the corretness of loop optimizations whose correctness cannot be guaranteed at compile time.Unlike compiler validation, run-time validation must not only determine when an optimization has generated incorrect code, but also recovering from the optimization without aborting the program or producing an incorrect result. We describe the extensions to our tool voc-64 which are required to validate these structure-modifying optimizations.
In this paper, for more aggressive optimizations that alter the loop structure of the code-such as distribution, fusion, tiling, and interchange-we present a set of permutation rules which establish that the transformed code satisfies all the implied data dependencies necessary for the validity of the considered transformation.uses a single unimodular matrix to describe the combined result of a sequence of many of the above transformations.