A method for estimating optimal unrolling times for nested loops

Loop unrolling is one of the most promising parallelization techniques, because the nature of programs causes most of the processing time to be spent in their loops. Unrolling not only the innermost loop but also outer loops greatly expands the scope for reusing data and pnrullelizing instructions. Nested-loop unrolling is therefore a very effective way of obtaining a higher degree of parallelism, However, we need a method for measuring the eflciency of loop unrolling that takes account of both the reuse of data and the pamllelesm between instructions. This paper desc,ribes a heuristic algorithm for deciding the number of times and the directions in which loops should be unrolled, through the use of information such as dependence, reuse, and machine resources. Our method is evaluated by applying benchmark tests.

• Type: Conference
• Year: 1997
• Where: ISPAN
• Authors: Akira Koseki, Hideaki Komatsu, Yoshiaki Fukazawa
• Keywords: Distributed And Parallel Computing, ISPAN 1997, Loop Unrolling, Nested-loop Unrolling, Promising Parallelization Techniques