A method for estimating optimal unrolling times for nested loops

A. Koseki, H. Komastu, Y. Fukazawa

研究成果: Paper査読

10 被引用数 (Scopus)

抄録

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.

本文言語English
ページ376-382
ページ数7
DOI
出版ステータスPublished - 1997
イベント3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997 - Taipei, Taiwan, Province of China
継続期間: 1997 12月 181997 12月 20

Conference

Conference3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997
国/地域Taiwan, Province of China
CityTaipei
Period97/12/1897/12/20

ASJC Scopus subject areas

  • コンピュータ ネットワークおよび通信
  • ハードウェアとアーキテクチャ
  • 安全性、リスク、信頼性、品質管理

フィンガープリント

「A method for estimating optimal unrolling times for nested loops」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル