Home           Contact us           FAQs           
     Journal Home     |     Aim & Scope    |    Author(s) Information      |     Editorial Board     |     MSP Download Statistics
2012 (Vol. 4, Issue: 19)
Article Information:

Code Optimization Using Graph Mining

Saranya Venkatachalam, N. Sairam and B. Srinivasan
Corresponding Author:  Saranya Venkatachalam 

Key words:  Control Flow Graph (CFG) , dominators, loop invariants, , , ,
Vol. 4 , (19): 3618-3622
Submitted Accepted Published
February 02, 2012 March 01, 2012 October 01, 2012

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.
Abstract PDF HTML
  Cite this Reference:
Saranya Venkatachalam, N. Sairam and B. Srinivasan, 2012. Code Optimization Using Graph Mining.  Research Journal of Applied Sciences, Engineering and Technology, 4(19): 3618-3622.
    Advertise with us
ISSN (Online):  2040-7467
ISSN (Print):   2040-7459
Submit Manuscript
   Current Information
   Sales & Services
Home  |  Contact us  |  About us  |  Privacy Policy
Copyright © 2015. MAXWELL Scientific Publication Corp., All rights reserved