Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2005.12A.1.079

An Efficient Algorithm for Sparse Code Motion  

Shin Hyun-Deok (관동대학교 대학원 컴퓨터공학과)
Yu Heui-Jong (관동대학교 대학원 컴퓨터공학과)
Ahn Heui-Hak (관동대학교 컴퓨터공학과)
Publication Information
The KIPS Transactions:PartA / v.12A, no.1, 2005 , pp. 79-86 More about this Journal
Abstract
This 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 audition 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.
Keywords
Code Motion; Sparse Code Motion; BCM; LCM;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Knoop, J., Rtithing, O. and Steffen, B., 'Lazy code motion', In Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation'92, ACM SIGPLAN Notices, Vol.27, No.7, pp.224-234, San Francisco. CA, June, 1992   DOI
2 Knoop, J., Rtithing, O. and Steffen, B., 'Optimal Code motion: Theory and Practice', ACM Transactions on Programming Languages and Systems, Vol.16, No.4, pp.1117-1155, 1994   DOI   ScienceOn
3 Knoop, J., Ruthing, O. and Steffen, B., 'The Power of Assignment Motion', Proceedings of the Conference on Programming Language Design and Implementation, Vol.30, No.6, pp.233-245, 1995   DOI
4 Knoop, J. and Steffen, B., 'Sparse Code Motion', Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of Programming languages, pp.170-183, January, 2000   DOI
5 Briggs, P. and Cooper, K. D., 'Effective partial redundancy elimination', In Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation '94, ACM SIGPLAN Notices, Vol. 29, No.6, pp.159-170, Orlando, FL, June, 1994   DOI
6 Dhamdhere, D. M., 'A fast algorithm for code movement optimization', ACM SIGPLAN Notices, Vol.23, No. 10, pp.172-180, 1998   DOI
7 Dhamdhere, D. M. and Pati!o H., 'An elimination algorithm for bidirectional data flow problems using edge placement', ACM Transactions of Programming languages and Systems, Vol.15, No.2, pp.312- 336, April, 1993   DOI   ScienceOn
8 Drechsler, K. H. and Stadel, M. P., 'A variation of Knoop, Riithing and Steffen's lazy code motion', ACM SIGPLAN Notices, Vol.28, No.5, pp.29-38, 1993   DOI
9 Aho, A. V., Sethi, R., and Ullman. J. D, 'Compilers Principles, Techniques, and Tools', Addison-Wesley publishing Co., 1986