Improving on Linear Scan Register Allocation
文献类型：期刊论文
| 作者 | Shahrzad Kananizadeh2; Kirill Kononenko1 |
| 刊名 | International Journal of Automation and Computing
 |
| 出版日期 | 2018 |
| 卷号 | 15期号:2页码:228-238 |
| 关键词 | Register allocation just-in-time compilation code generation static analysis dynamic analysis. |
| ISSN号 | 1476-8186 |
| DOI | 10.1007/s11633-017-1100-0 |
| 英文摘要 | Register allocation is a major step for all compilers. Various register allocation algorithms have been developed over the decades. This work describes a new class of rapid register allocation algorithms and presents experimental data on their behavior. Our research encourages the avoidance of graphing and graph-coloring based on the fact that precise graph-coloring is nondeterministic polynomial time-complete (NP-complete), which is not suitable for real-time tasks. In addition, practical graph-coloring algorithms tend to use polynomial-time heuristics. In dynamic compilation environments, their super linear complexity makes them unsuitable for register allocation and code generation. Existing tools for code generation and register allocation do not completely fulfill the requirements of fast compilation. Existing approaches either do not allow for the optimization of register allocation to be achieved comprehensively with a sufficient degree of performance or they require an unjustifiable amount of time and/or resources. Therefore, we propose a new class of register allocation and code generation algorithms that can be performed in linear time. These algorithms are based on the mathematical foundations of abstract interpretation and the computation of the level of abstraction. They have been implemented in a specialized library for just-in-time compilation. The specialization of this library involves the execution of common intermediate language (CIL) and low level virtual machine (LLVM) with a focus on embedded systems. |
| 源URL | [http://ir.ia.ac.cn/handle/173211/42405]  |
| 专题 | 自动化研究所_学术期刊_International Journal of Automation and Computing |
| 作者单位 | 1.École Normale Supérieure/French Institute for Research in Computer Science and Automation (INRIA), Paris, France 2.Department of Computer Science, Saarland University, Saarbrücken, Germany |
| 推荐引用方式 GB/T 7714 | Shahrzad Kananizadeh,Kirill Kononenko. Improving on Linear Scan Register Allocation[J]. International Journal of Automation and Computing,2018,15(2):228-238. |
| APA | Shahrzad Kananizadeh,&Kirill Kononenko.(2018).Improving on Linear Scan Register Allocation.International Journal of Automation and Computing,15(2),228-238. |
| MLA | Shahrzad Kananizadeh,et al."Improving on Linear Scan Register Allocation".International Journal of Automation and Computing 15.2(2018):228-238. |
入库方式： OAI收割
来源：自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。