A Sparse Code Motion Algorithm forlifetime and computational optimization

수명적, 계산적 최적화를 위한 희소코드모션 알고리즘

  • 심손권 (강원도립대학 컴퓨터응용과)
  • Published : 2004.12.01


Generally, the code motion algorithm accomplishes the run-time optimal connected with the computational optimifation and the register overhead This paper proposes a sparse code motion, which considers the code size, in addition to computational optimization and lifetime optimization. The BCM algorithm carries out the optimal code motion computationally and the LCM algorithm reduces the register overhead in a sparse code motion algorithm. A sparse code motion algorithm is optimum algorithm computationally and lifetime because of suppression unnecessary code motion This algorithm improves runtime and efficiency of the program than the previous work through the performance test.