Code optimizations for size based on architecture transformations
Fundamentalʹnaâ i prikladnaâ matematika, Tome 14 (2008) no. 4, pp. 193-212
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
The article reveals a new approach for code optimizations for size, which is based on allowing deep transformations of the source code when performing optimizations. Transformations of function signatures are described as a basis. The article contains algorithm descriptions including efficiency evaluations, examples, and appropriate use cases.
[1] Kasperski K., Tekhnika optimizatsii programm. Effektivnoe ispolzovanie pamyati, BKhV-Peterburg, SPb., 2003
[2] Fauler M., Refaktoring: uluchshenie suschestvuyuschego koda, Simvol-Plyus, SPb., 2005
[3] Muchnik S., Advanced Compiler Design and Implementation, Academic Press, 1997
[4] Muchnik S., Optimizing Compilers for Modern Architectures: A Dependence-Based Approach, Academic Press, 2002