Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Zhejiang University(Engineering Science)》 2014-01
Add to Favorite Get Latest Update

Condition code optimization in dynamic binary translation

WANG Rong-hua;MENG Jian-yi;CHEN Zhi-jian;YAN Xiao-lang;Institute of VLSI Design,Zhejiang University;  
An efficient mapping method named compare and condition branch fast mapping algorithm was proposed in order to improve emulating and processing speed of condition flags.The algorithm mainly focuses on‘compare and condition branch'instruction pairs which occupy a large proportion of condition code defining and using instruction pair.The method dynamically identifies and extracts the"compare and condition branch"instruction pair in the source block and completes instruction mapping by using the inherent conditional dependencies of the target machine.By avoiding the complex and uniform traditional processes for these special instruction pairs,dynamic binary translator has achieved great performance improvement.Results of benchmark on QEMU emulator showed that the generated instruction number for translating condition code was reduced by 20% to 90% than that of traditional methods.
【Fund】: 中央高校基本科研业务费资助项目(2012QNA5004)
【CateGory Index】: TP314
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved