The week's pick
Random Articles
Reseach Article
New trends and Challenges in Source Code Optimization
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 131 - Number 16 |
| Year of Publication: 2015 |
| Authors: Anjan Kumar Sarma |
10.5120/ijca2015907609
|
Anjan Kumar Sarma . New trends and Challenges in Source Code Optimization. International Journal of Computer Applications. 131, 16 ( December 2015), 27-32. DOI=10.5120/ijca2015907609
Abstract
The front end of a compiler is generally responsible for creating an intermediate representation of the source program whereas the back end of the compiler constructs the desired target program from the intermediate representation and the information in the symbol table. Before the intermediate code is passed to the back end of the compiler, it is necessary to improve the intermediate code so that better target code will result. The code optimization phase in a compiler attempts to improve the target code without changing its output or without side-effects. Today, most of the compiler research is done in the optimization phase. There are many classical techniques (e.g. Eliminating common sub-expressions, Dead-Code elimination, Constant Folding etc.) that have been used in code optimization. However, the increasing size and complexity of software products and the use of these products in embedded, web-based and mobile systems results in the demand for more optimized versions of the source code. This research paper discusses the challenges involved in code optimization for such systems and some recently developed techniques in code optimization.
References
- Alfred Aho, Ravi Sethi, Jeffrey D Ullman, “Compilers Principles, Techniques and Tools”, Pearson Education Asia
- O.G.Kakde, (2008), “Compiler Design”, Universities Press
- Carole Dulong, Rajiv Gupta, Robert Kennedy, Jens Knoop, Jim Pierce (editors), (2000) “Code Optimization – Trends, Challenges, and Perspectives” Dagstuhl-Seminar-Report; 286, 17.9.–22.9.2000 (00381)
- Caspar Gries, (2009), “New Trends in the Optimization of C-Code”,
- Kenneth Hoste Lieven Eeckhout,ELIS Department, Ghent University,” COLE: Compiler Optimization Level Exploration”
- Urban Boquist, “Code optimization Techniques for Lazy Functional Languages”, Thesis for the Degree of Doctor ,Goteborg University,
- Stan Yi- Huang Liao, “Code Generation and Optimization for Embedded Digital Signal Processors”, Massachusetts Institute of Technology
- Neil Edward Johnson, “Code Size Optimization for Embedded Processors”, Robinson College, Thesis for the Doctor of Philosophy at the University of Cambridge
- Neil Johnson and Alan Mycroft, “Using Multiple Memory Access Instructions for Reducing Code Size”, University of Cambridge
- Johnson, N., and Mycroft, A., (2003) “Combined Code Motion and Register Allocation using the Value State Dependence Graph.” In Proc. 12th International Conference on Compiler Construction (CC'03) (April 2003), vol. 2622 of LNCS (Springer-Verlag)
- Gergö Barany, “Integrated Code Motion and Register Allocation”, Thesis for the Degree of Doctor, Vienna University of Technology
- Qingfeng Zhuge, Bin Xiao, Edwin H.-M. Sha,“ Performance optimization of Multiple Memory Architectures for DSP”
- Josef Weidendorfer, “Analysis and Optimization of the Memory Access Behavior of Applications”
- Prajakta Gotarane, Sumedh Pundkar, (2015) “Smart Coding using New Code Optimization Techniques in Java to Reduce Runtime Overhead of Java Compiler”, International Journal of Computer Applications (0975 – 8887), Volume 125 – No.15, September 2015
- Keith D. Cooper 1 and L. Taylor Simpson, “Live Range Splitting in a Graph Coloring Register Allocator”, Rice University, Houston, Texas, USA,
- Preston Briggs, Keith D. Coope,Linda Torczon,, “Aggressive Live Range Splitting”, Houston University, Texas, USA
- Michael Burke, Linda Torczon, “Inter-procedural Optimization: Eliminating Unnecessary Recompilation”, IBM Research, Rice University
Index Terms
Keywords