The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
A otimização de loop desempenha um papel importante na otimização do compilador e na transformação do programa. Muitas técnicas sofisticadas, como movimento de código com invariância de loop, reestruturação de loop e fusão de loop, foram desenvolvidas. Este artigo apresenta uma nova técnica chamada movimento de código de quase-invariância em loop. É uma generalização do movimento de código de invariância de loop padrão, mas baseado na análise de quase-invariância de loop. A quase-invariância de loop é semelhante à invariância de loop padrão, mas permite um número finito de iterações antes que os cálculos em um loop se tornem invariantes. Neste artigo definimos a noção de quase-invariância de loop, apresentamos um algoritmo para calcular estaticamente o comprimento ideal de desdobramento em programas While e fornecemos um método de transformação. Nosso método pode aumentar a precisão das análises do programa e melhorar a eficiência dos programas, tornando os loops menores e mais rápidos. Nossa técnica é adequada para suportar transformações em compiladores, avaliadores parciais e outros transformadores de programas.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Litong SONG, Yoshihiko FUTAMURA, Robert GLUCK, Zhenjiang HU, "Loop Quasi-Invariance Code Motion" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 10, pp. 1841-1850, October 2000, doi: .
Abstract: Loop optimization plays an important role in compiler optimization and program transformation. Many sophisticated techniques such as loop-invariance code motion, loop restructuring and loop fusion have been developed. This paper introduces a novel technique called loop quasi-invariance code motion. It is a generalization of standard loop-invariance code motion, but based on loop quasi-invariance analysis. Loop quasi-invariance is similar to standard loop-invariance but allows for a finite number of iterations before computations in a loop become invariant. In this paper we define the notion of loop quasi-invariance, present an algorithm for statically computing the optimal unfolding length in While-programs and give a transformation method. Our method can increase the accuracy of program analyses and improve the efficiency of programs by making loops smaller and faster. Our technique is well-suited as supporting transformation in compilers, partial evaluators, and other program transformers.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_10_1841/_p
Copiar
@ARTICLE{e83-d_10_1841,
author={Litong SONG, Yoshihiko FUTAMURA, Robert GLUCK, Zhenjiang HU, },
journal={IEICE TRANSACTIONS on Information},
title={Loop Quasi-Invariance Code Motion},
year={2000},
volume={E83-D},
number={10},
pages={1841-1850},
abstract={Loop optimization plays an important role in compiler optimization and program transformation. Many sophisticated techniques such as loop-invariance code motion, loop restructuring and loop fusion have been developed. This paper introduces a novel technique called loop quasi-invariance code motion. It is a generalization of standard loop-invariance code motion, but based on loop quasi-invariance analysis. Loop quasi-invariance is similar to standard loop-invariance but allows for a finite number of iterations before computations in a loop become invariant. In this paper we define the notion of loop quasi-invariance, present an algorithm for statically computing the optimal unfolding length in While-programs and give a transformation method. Our method can increase the accuracy of program analyses and improve the efficiency of programs by making loops smaller and faster. Our technique is well-suited as supporting transformation in compilers, partial evaluators, and other program transformers.},
keywords={},
doi={},
ISSN={},
month={October},}
Copiar
TY - JOUR
TI - Loop Quasi-Invariance Code Motion
T2 - IEICE TRANSACTIONS on Information
SP - 1841
EP - 1850
AU - Litong SONG
AU - Yoshihiko FUTAMURA
AU - Robert GLUCK
AU - Zhenjiang HU
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 2000
AB - Loop optimization plays an important role in compiler optimization and program transformation. Many sophisticated techniques such as loop-invariance code motion, loop restructuring and loop fusion have been developed. This paper introduces a novel technique called loop quasi-invariance code motion. It is a generalization of standard loop-invariance code motion, but based on loop quasi-invariance analysis. Loop quasi-invariance is similar to standard loop-invariance but allows for a finite number of iterations before computations in a loop become invariant. In this paper we define the notion of loop quasi-invariance, present an algorithm for statically computing the optimal unfolding length in While-programs and give a transformation method. Our method can increase the accuracy of program analyses and improve the efficiency of programs by making loops smaller and faster. Our technique is well-suited as supporting transformation in compilers, partial evaluators, and other program transformers.
ER -