|
Abstract
|
Article Information:
Code Optimization Using Graph Mining
Saranya Venkatachalam, N. Sairam and B. Srinivasan
Corresponding Author: Saranya Venkatachalam
Submitted: February 02, 2012
Accepted: March 01, 2012
Published: October 01, 2012 |
Abstract:
|
In compiler theory, optimization is the process of fine-tuning the output of a compiler to curtail or
capitalize on some aspects of an executable computer program. Optimization is commonly implemented using
a chain of optimizing transformations, algorithms which inputs a program and transform it to produce an
equivalent output program that yields better performance. In this study, we propose a novel technique which
involves the concept of dominators to optimize the code. This technique is employed to a graph, depicting the
program flow (CFG) from which, the information is extracted and the loop invariants are relocated to the
dominating program block there by reducing the redundant computation.
Key words: Control Flow Graph (CFG) , dominators, loop invariants, , , ,
|
|
Abstract
|
PDF
|
HTML |
|
Cite this Reference:
Saranya Venkatachalam, N. Sairam and B. Srinivasan, . Code Optimization Using Graph Mining. Research Journal of Applied Sciences, Engineering and Technology, (19): 3618-3622.
|
|
|
|
 |
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
 |
| Information |
|
|
|
|
| Sales & Services |
|
|
|
|
