首页 | 本学科首页   官方微博 | 高级检索  
     

二进制翻译中代码生成的子图覆盖算法
引用本文:陈顼颢,郑重,沈立,王志英.二进制翻译中代码生成的子图覆盖算法[J].计算机科学与探索,2011,5(7):613-623.
作者姓名:陈顼颢  郑重  沈立  王志英
作者单位:国防科学技术大学计算机学院,长沙,410073
基金项目:国家自然科学基金No.60803041; 国家重点基础研究发展规划(973)No.2007CB310901; 国防科技大学优秀研究生创新项目No.S090606~~
摘    要:二进制翻译技术能够有效解决二进制兼容问题,促进新型体系结构的发展,也是虚拟机技术的重要组成部分,具有重要的研究和应用价值,但是其效率仍然有待提升,特别是目标代码生成的效率。设计了一种高效的目标代码生成算法——代码生成的子图覆盖算法(subgraph covering for code generation,SCCG),能够以尽可能少的代价生成精简的目标代码。该算法应用数据流图对二进制代码中的基本块进行建模,获取指令间的数据相关,并采用基于子图覆盖的贪心算法得到目标代码。在TransARM原型系统中进行了实现和测试,结果表明该算法获得了更优质的目标代码,并且成本得到了有效控制。

关 键 词:二进制翻译  数据流图(DFG)  子图覆盖  代码生成
修稿时间: 

Subgraph Covering for Efficient Code Generation in Binary Translation
CHEN Xuhao,ZHENG Zhong,SHEN Li,WANG Zhiying.Subgraph Covering for Efficient Code Generation in Binary Translation[J].Journal of Frontier of Computer Science and Technology,2011,5(7):613-623.
Authors:CHEN Xuhao  ZHENG Zhong  SHEN Li  WANG Zhiying
Affiliation:CHEN Xuhao,ZHENG Zhong,SHEN Li,WANG Zhiying College of Computer,National University of Defense Technology,Changsha 410073,China
Abstract:As an efficient way to solve binary compatibility problem, binary translation can promote the development of novel architecture, and is an important part of virtual machine. Although it has great value in research and application, its efficiency is a bottleneck, especially the efficiency of its target code generation procedure. This paper designs an efficient code generation algorithm — subgraph covering for code generation (SCCG), which can generate reduced code with as less cost as possible. It employs data flow graph (DFG) to model basic blocks in binary code and find the dependency between instructions, and applies a greedy algorithm based on subgraph covering to obtain target code. This algorithm is implemented and tested in TransARM prototype system, the results show that it obtains better target code and limits its cost well.
Keywords:binary translation  data flow graph(DFG)  subgraph covering  code generation  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机科学与探索》浏览原始摘要信息
点击此处可从《计算机科学与探索》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号