.png){kind=icon}
.png){kind=icon}
Return
Binary compatibility for embedded systems using greedy subgraph mapping
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-014-5089-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a novel lightweight code generation algorithm GSM (Greedy Subgraph Mapping), which can generate compact code with low overhead using many-to-one mapping. GSM is implemented and evaluated in a dynamic binary translation prototype system called TransARM. Experimental results demonstrate that GSM generates higher quality target code than a conventional implementation, which brings an average code expansion rate close to 1.3 for the selected 11 benchmarks. Moreover, GSM causes slightly extra overhead and negligible slowdown of translation and enables 10% performance improvement for target code execution.
Keywords:
dynamic binary translation
code generation
many-to-one mapping
greedy subgraph mapping
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
4.9K
Citations:
8.9K