ADJUSTING A PROGRAM TRANSFORMATION FOR LEGALITY

摘要: Program transformations are one of the most valuable compiler techniques to improve parallelism or data locality. However, restructuring compilers have a hard time coping with dependences. A typical solution is focus on program parts where dependences simple enough enable any transformation. For more complex problems only addressed question checking whether transformation legal not. In this paper we propose go further. Starting from no guarantee legality, show how can correct it for dependence satisfaction. Two directions explored: first when properties be explicitly expressed and second they implicit as in locality case. Generating code having best direct application result.