An Assignment Motion Algorithm to Suppress the Unnecessary Code Motion


The KIPS Transactions:PartA, Vol. 8, No. 1, pp. 27-35, Mar. 2001
10.3745/KIPSTA.2001.8.1.27,   PDF Download:

Abstract

This paper presents the assignment motion algorithm unrestricted for code optimization computationally. So, this algorithm is suppressed the unnecessary code motion in order to avoid the superfluous register pressure. we propose the assignment motion algorithm added to the final optimization phase. This paper improves an ambiguous meaning of the predicate. For mixing the basic block level analysis with the instruction level analysis, an ambiguity occurred in knoop's algorithm. Also, we eliminate an ambiguity of it. Our proposal algorithm improves the runtime efficiency of a program by avoiding the unnecessary recomputations and reexecutions of expressions and assignment statements.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
H. D. Shin and H. H. Ahn, "An Assignment Motion Algorithm to Suppress the Unnecessary Code Motion," The KIPS Transactions:PartA, vol. 8, no. 1, pp. 27-35, 2001. DOI: 10.3745/KIPSTA.2001.8.1.27.

[ACM Style]
Hyun Deok Shin and Heui Hak Ahn. 2001. An Assignment Motion Algorithm to Suppress the Unnecessary Code Motion. The KIPS Transactions:PartA, 8, 1, (2001), 27-35. DOI: 10.3745/KIPSTA.2001.8.1.27.