Split Register Allocation: Linear Complexity Without the Performance Penalty (2010)
by
Boubacar Diouf
,
Albert Cohen
,
Fabrice Rastello
,
John Cavazos
| Venue: | in "International Conference on High-Performance Embedded Architectures and Compilers (HiPEAC’10)", Lecture Notes in Computer Science |
| Citations: | 1 - 0 self |
BibTeX
@INPROCEEDINGS{Diouf10splitregister,
author = {Boubacar Diouf and Albert Cohen and Fabrice Rastello and John Cavazos},
title = {Split Register Allocation: Linear Complexity Without the Performance Penalty},
booktitle = {in "International Conference on High-Performance Embedded Architectures and Compilers (HiPEAC’10)", Lecture Notes in Computer Science},
year = {2010},
publisher = {Springer Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Traditional bytecode language tool chains distribute the roles among offline and online compilers. Verification and code compaction are typically assigned to ofinria-00551513,
