An Efficient Algorithm for Sparse Code Motion


The KIPS Transactions:PartA, Vol. 12, No. 1, pp. 79-86, Feb. 2005
10.3745/KIPSTA.2005.12.1.79,   PDF Download:

Abstract

The paper suggests that sparse code motion algorithm should be used to make the code optimal in the respect of computation and lifetime. This algorithm is SpCM algorithm, which expand BCM and LCM algorithm. BCM algorithm carries out the optimal code motion computationally and LCM algorithm reduces the register pressure in SpCM algorithm. Generally, code motion algorithm accomplishes the run-time optimal connected with the optimum of computation and the register pressure. Computational cost and consideration of the code size in the register pressure are also added in the paper. The optimum of code motion could be obtained through SpCM algorithm, which considers the code size, in addition to computational optimal and lifetime optimal. The algorithm presented in this paper is the most optimal algorithm in the respect of computation and lifetime, as all the unnecessary code motions are restrained.


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, H. J. Yu, H. H. Ahn, "An Efficient Algorithm for Sparse Code Motion," The KIPS Transactions:PartA, vol. 12, no. 1, pp. 79-86, 2005. DOI: 10.3745/KIPSTA.2005.12.1.79.

[ACM Style]
Hyun Deok Shin, Heui Jong Yu, and Heui Hak Ahn. 2005. An Efficient Algorithm for Sparse Code Motion. The KIPS Transactions:PartA, 12, 1, (2005), 79-86. DOI: 10.3745/KIPSTA.2005.12.1.79.