Abstract
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 parallelizing 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 efficiency of loop unrolling that takes account of both the reuse of data and the parallelism between instructions. This paper describes 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.
| Original language | English |
|---|---|
| Pages | 376-382 |
| Number of pages | 7 |
| DOIs | |
| Publication status | Published - 1997 |
| Event | 3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997 - Taipei, Taiwan, Province of China Duration: 1997 Dec 18 → 1997 Dec 20 |
Conference
| Conference | 3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997 |
|---|---|
| Country/Territory | Taiwan, Province of China |
| City | Taipei |
| Period | 97/12/18 → 97/12/20 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Hardware and Architecture
- Safety, Risk, Reliability and Quality