Linear scan register allocation Export

@article{citeulike:5990369, abstract = {We describe a new algorithm for fast global register allocation called linear scan . This algorithm is not based on graph coloring, but allocates registers to variables in a single linear-time scan of the variables' live ranges. The linear scan algorithm is considerably faster than algorithms based on graph coloring, is simple to implement, and results in code that is almost as efficient as that obtained using more complex and time-consuming register allocators based on graph coloring. The algorithm is of interest in applications where compile time is a concern, such as dynamic compilation systems, \“just-in-time\” compilers, and interactive development environments.}, address = {New York, NY, USA}, author = {Poletto, Massimiliano and Sarkar, Vivek}, citeulike-article-id = {5990369}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=330249.330250}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/330249.330250}, doi = {10.1145/330249.330250}, issn = {0164-0925}, journal = {ACM Trans. Program. Lang. Syst.}, keywords = {compilers, register\_allocation}, number = {5}, pages = {895--913}, posted-at = {2009-10-22 21:49:28}, priority = {0}, publisher = {ACM}, title = {Linear scan register allocation}, url = {http://dx.doi.org/10.1145/330249.330250}, volume = {21}, year = {1999} }

TY - JOUR ID - citeulike:5990369 L3 - citeulike-article-id:5990369 N2 - We describe a new algorithm for fast global register allocation called linear scan . This algorithm is not based on graph coloring, but allocates registers to variables in a single linear-time scan of the variables' live ranges. The linear scan algorithm is considerably faster than algorithms based on graph coloring, is simple to implement, and results in code that is almost as efficient as that obtained using more complex and time-consuming register allocators based on graph coloring. The algorithm is of interest in applications where compile time is a concern, such as dynamic compilation systems, “just-in-time” compilers, and interactive development environments. IS - 5 JF - ACM Trans. Program. Lang. Syst. SN - 0164-0925 AD - New York, NY, USA EP - 913 TI - Linear scan register allocation PB - ACM VL - 21 SP - 895 KW - compilers KW - register_allocation AU - Poletto, Massimiliano AU - Sarkar, Vivek PY - 1999/// UR - http://dx.doi.org/10.1145/330249.330250 ER -