The KIPS Transactions:PartA (정보처리학회논문지A)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

An Algorithm of Solution for the Exceptional Field Problem in the Speculative Partial Redundancy Elimination(SPRE) Optimization

추론적 부분 중복 제거의 최적화 예외 영역 문제 해결 알고리즘

  • 신현덕 (관동대학교 컴퓨터학과) ;
  • 안희학 (관동대학교 컴퓨터학과)
  • Published : 2006.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper improves the algorithms for Speculative Partial Redundancy Elimination(SPRE) proposed by Knoop et al. This research brings up an issue concerning a field to which SPRE cannot be applied, and suggests a solution to the problem. The Improved SPRE algorithm performs the execution speed optimization based on the information on the execution frequency from profiling and the memory space optimization.

본 논문에서는 Knoop 등이 2004년에 제안한 추론적 부분 중복 제거 알고리즘을 개선한다. 본 연구에서는 기존 추론적 부분 중복 제거에서 최적화가 적용되지 않는 영역이 발생될 수 있는 문제를 제기하고 이 문제에 대한 해법을 제안한다. 개선된 추론적 부분 중복 제거 알고리즘은 컴파일러의 프로필링 기법을 통해 얻어진 실행 빈도에 대한 정보를 통해 실행 속도 최적화를 수행하며 메모리 최적화도 수행한다.

Keywords

References

  1. Bodik, R., Gupta, R. and Soffa, M.L., 'Complete removal of reducdant computations,' Proceed-ings of ACM Conference on Programming Language Design and Implementaion, Vol.33, No.5, pp. 1-14, New York, June 1998
  2. Cai, Q. and Xue. J., ' Optimal and Efficient speculation based partial reducdancy elimination,' Proceedings of the 1st IEEE/ACM International Symposium on Code Generation and optimization, pp.91-102, 2003 https://doi.org/10.1109/CGO.2003.1191536
  3. Gupta, R., Berson, D.A. and Fang, J, Z., 'Path profile guided partial reducdancy elimination using speculation,' Proceedings of the 1998 International conference on Computer Languages, pp.230-239, 1998 https://doi.org/10.1109/ICCL.1998.674173
  4. Horspoolm R.N. and Ho, H.C., 'Partial redundancy elimination driven by a cost-benefit an-alysis,' Proceedings of 8th Israeli Conference on Computer systems and Software Engineering, pp. 111-118, june 1997 https://doi.org/10.1109/ICCSSE.1997.599882
  5. Knoop, J., Ruthing, O. and Steffen, B., 'Optimal code motion: theory and practics,' ACM Transactions on Programming Languages and Systems, Vol.16 , No.4, pp. 1117-1155,1994 https://doi.org/10.1145/183432.183443
  6. Knoop, J., Ruthing, O. and Steffen, B., 'Partial dead code elimination,' In Proc. ACM SIG-PLAN Conference on Programming Language Design and Implementation'94, of ACM SIG-PLAN Notices, Vol.29, No.6 pp.147-158, Orlando, FL, June 1994
  7. Morel, E. and Renvoise, C., 'Global optimization by suppression of partial redundancies,' Communications of the ACM, Vol.22, No.2, pp. 96-103, 1979 https://doi.org/10.1145/359060.359069
  8. Scholz, B., Horspool, N. and Knoop, J., 'Optimizing for space and time usage with specula-tive partial redundancy elimination,' ACM SIGPLAN Notices, proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Language, compilers, and tools for embedded systems, Vol.39, No.7, pp.221-230, June 2004 https://doi.org/10.1145/998300.997195