Access Restriction

Author Koseki, A. ♦ Komastu, H. ♦ Fukazawa, Y.
Source CiteSeerX
Content type Text
Publisher IEEE CS Press
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Optimal Unrolling Time ♦ Nested Loop ♦ Promising Paral-lelization Technique ♦ Paper Desc ♦ Loop Unrolling ♦ Effective Way ♦ Benchmark Test ♦ Ma-chine Resource ♦ Innermost Loop ♦ Outer Loop ♦ Heuristic Algorithm ♦ Nested-loop Unrolling ♦ Processing Time
Description Loop unrolling is one of the most promising paral-lelization 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 di-rections in which loops should be unrolled, through the use of information such as dependence, reuse, and ma-chine resources. Our method is evaluated by applying benchmark tests. 1
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 1997-01-01
Publisher Institution ISPAN ’97: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN