- 期刊
- OpenAccess
Code Optimization Using Graph Mining
並列摘要
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.
延伸閱讀
- Ke, C. C., & Yang, C. L. (2010). Algorithms on Generating Regular Graphs. 明道學術論壇, 6(1), 3-17. https://doi.org/10.6953/MJ.201003.0002
- Hsiao, C. L. (2006). Discovering Term Relations Through An Example-based Web Mining Approach [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2006.02599
- Tai, C. H. (2011). Graph-based Data Mining for Transactional,Spatial and Social-networking Data [doctoral dissertation, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2011.00793
- 鄭宏彬（2012）。Design and Implementation of Graph-Based Web Service Matchmaking System〔碩士論文，國立中央大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0031-1903201314432491
- Wang, J. M. (2013). Attributed Hyper-Graph Matching in ITS Applications [doctoral dissertation, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2013.03091