An Assignment Motion to Suppress the Unnecessary Code Motion

Hyun-Deok Shin; Dae-Sik Lee; Heui-Hak Ahn

An Assignment Motion to Suppress the Unnecessary Code Motion

Hyun-Deok Shin, Dae-Sik Lee, Heui-Hak Ahn, Journal of Internet Computing and Services, Vol. 9, No. 1, pp. 55-68, Feb. 2008
Full Text:

Keywords: code optimization, assignment motion, code motion

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 November 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

[APA Style]

Shin, H., Lee, D., & Ahn, H. (2008). An Assignment Motion to Suppress the Unnecessary Code Motion. Journal of Internet Computing and Services, 9(1), 55-68.

[IEEE Style]

H. Shin, D. Lee, H. Ahn, "An Assignment Motion to Suppress the Unnecessary Code Motion," Journal of Internet Computing and Services, vol. 9, no. 1, pp. 55-68, 2008.

[ACM Style]

Hyun-Deok Shin, Dae-Sik Lee, and Heui-Hak Ahn. 2008. An Assignment Motion to Suppress the Unnecessary Code Motion. Journal of Internet Computing and Services, 9, 1, (2008), 55-68.