The Community for Technology Leaders
Parallel Architectures, Algorithms and Programming, International Symposium on (2011)
Tianjin, China
Dec. 9, 2011 to Dec. 11, 2011
ISBN: 978-0-7695-4575-2
pp: 231-235
ABSTRACT
Dynamic binary translation is an effective way to address binary compatibility problem. Embedded systems and other novel RISC ISAs are developing fast without consideration of the binary compatibility with off-the-shelf x86 applications, making dynamic binary translator (DBT) from CISC to RISC more important. However, dynamic code generation is still inefficient due to the code expansion. Conventional code generators in DBTs use one-to-many mapping scheme between source and target code which cannot take full advantage of the target ISA. We propose a novel lightweight code generation algorithm GSM (Greedy Sub graph Mapping), which can generate compact code with low overhead using many-to-one mapping. GSM is implemented and evaluated in a DBT prototype system called TransARM. Experimental results demonstrate that GSM generates higher quality target code compared to a conventional implementation, which brings code expansion rate close to 1.3. Moreover, GSM causes slightly extra overhead and negligible slowdown of translation, and enables 10% performance improvement for target code execution.
INDEX TERMS
dynamic binary translation, code generation, data flow graph, many-to-one mapping, greedy subgraph mapping
CITATION
Xuhao Chen, Zhong Zheng, Zhiying Wang, Wei Chen, Li Shen, "GSM: An Efficient Code Generation Algorithm for Dynamic Binary Translator", Parallel Architectures, Algorithms and Programming, International Symposium on, vol. 00, no. , pp. 231-235, 2011, doi:10.1109/PAAP.2011.34
101 ms
(Ver 3.3 (11022016))