{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:55:05Z","timestamp":1770285305210,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030805142","type":"print"},{"value":"9783030805159","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T00:00:00Z","timestamp":1623456000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T00:00:00Z","timestamp":1623456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-80515-9_22","type":"book-chapter","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T20:04:54Z","timestamp":1670529894000},"page":"303-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Register Allocation"],"prefix":"10.1007","author":[{"given":"Florent Bouchez","family":"Tichadou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrice","family":"Rastello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,12]]},"reference":[{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Berson, D. A., Gupta, R., & Soffa, M. L. (1999). Integrated instruction scheduling and register allocation techniques. In Proceedings of the International Workshop on Languages and Compilers for Parallel Computing. LCPC \u201998 (pp. 247\u2013262).","DOI":"10.1007\/3-540-48319-5_16"},{"key":"22_CR39","doi-asserted-by":"crossref","unstructured":"Bouchez, F., et al. (2006). Register allocation: What does the NP-completeness proof of chaitin et al. really prove? Or revisiting register allocation: Why and how. In Proceedings of the International Workshop on Languages and Compilers for Parallel Computing. LCPC \u201906 (pp. 283\u2013298).","DOI":"10.1007\/978-3-540-72521-3_21"},{"key":"22_CR42","doi-asserted-by":"crossref","unstructured":"Bouchez, F., Darte, A., & Rastello, F. (2008). Advanced conservative and optimistic register coalescing. In Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems. CASES \u201908 (pp. 147\u2013156).","DOI":"10.1145\/1450095.1450119"},{"key":"22_CR46","doi-asserted-by":"crossref","unstructured":"Braun, M., Mallon, C., & Hack, S. (2010). Preference-guided register assignment. In International Conference on Compiler Construction. CC \u201910 (pp. 205\u2013223). New York: Springer.","DOI":"10.1007\/978-3-642-11970-5_12"},{"key":"22_CR51","unstructured":"Brisk, P., et al. (2005). Polynomial-time graph coloring register allocation. In International Workshop on Logic and Synthesis. IWLS \u201905."},{"issue":"4","key":"22_CR71","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/88616.88621","volume":"12","author":"F Chow","year":"1990","unstructured":"Chow, F., & Hennessy, J. L. (1990). The priority-based coloring approach to register allocation. ACM Transactions on Programming Language and Systems, 12(4), 501\u2013536.","journal-title":"ACM Transactions on Programming Language and Systems"},{"key":"22_CR78","doi-asserted-by":"crossref","unstructured":"Codina, J. M., S\u00e1nchez, J., & Gonz\u00e1lez, A. (2001). A unified modulo scheduling and register allocation technique for clustered processors. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques. PACT \u201901 (pp. 175\u2013184).","DOI":"10.1109\/PACT.2001.953298"},{"key":"22_CR80","doi-asserted-by":"crossref","unstructured":"Colombet, Q., et al. (2011). Graph-coloring and register allocation using repairing. In Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems. CASES \u201904 (pp. 45\u201354).","DOI":"10.1145\/2038698.2038708"},{"key":"22_CR87","unstructured":"Cytron, R. K., & Ferrante, J. (1987). What\u2019s in a name? or the value of renaming for parallelism detection and storage allocation. In Proceedings of the 1987 International Conference on Parallel Processing (pp. 19\u201327)."},{"key":"22_CR111","doi-asserted-by":"crossref","unstructured":"Fabri, J. (1979). Automatic storage optimization. In SIGPLAN \u201979.","DOI":"10.1145\/800229.806957"},{"key":"22_CR132","doi-asserted-by":"crossref","unstructured":"Grund, D., & Hack, S. (2007). A fast cutting-plane algorithm for optimal coalescing. In International Conference on Compiler Construction. CC \u201907 (pp. 111\u2014125).","DOI":"10.1007\/978-3-540-71229-9_8"},{"key":"22_CR136","unstructured":"Hack, S., Grund, D., & Goos, G. (2005). Towards Register Allocation for Programs in SSA Form. Technical Report 2005\u201327. University of Karlsruhe."},{"key":"22_CR190","doi-asserted-by":"crossref","unstructured":"Lueh, G.-Y., Gross, T., & Adl-Tabatabai, A.-R. (2000). Fusion-based register allocation. ACM Transactions on Programming Language and Systems, 22(3), 431\u2013470 (2000).","DOI":"10.1145\/353926.353929"},{"key":"22_CR203","doi-asserted-by":"crossref","unstructured":"M\u00f6ssenb\u00f6ck, H., & Pfeiffer, M. (2002). Linear scan register allocation in the context of SSA form and register constraints. In International Conference on Compiler Construction. CC \u201902 (pp. 229\u2013246).","DOI":"10.1007\/3-540-45937-5_17"},{"key":"22_CR204","volume-title":"Combining Register Allocation and Instruction Scheduling","author":"R Motwani","year":"1995","unstructured":"Motwani, R., et al. (1995). Combining Register Allocation and Instruction Scheduling. Technical Report. Stanford University."},{"key":"22_CR209","doi-asserted-by":"crossref","unstructured":"Norris, C., & Pollock, L. L. (1993). A scheduler-sensitive global register allocator. In Proceedings of the International Conference on Supercomputing. ICS \u201993 (pp. 804\u2013813). New York: IEEE.","DOI":"10.1145\/169627.169839"},{"issue":"4","key":"22_CR219","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1145\/1011508.1011512","volume":"26","author":"J Park","year":"2004","unstructured":"Park, J., & Moon, S.-M. (2004). Optimistic register coalescing. ACM Transactions on Programming Language and Systems, 26(4), 735\u2013765.","journal-title":"ACM Transactions on Programming Language and Systems"},{"key":"22_CR221","doi-asserted-by":"crossref","unstructured":"Pereira, F. M. Q., & Palsberg, J. (2005). Register allocation via coloring of chordal graphs. In Asian Symposium on Programming Languages and Systems. APLAS \u201905 (pp. 315\u2013329).","DOI":"10.1007\/11575467_21"},{"key":"22_CR226","doi-asserted-by":"crossref","unstructured":"Pinter, S. S. (1993). Register allocation with instruction scheduling. In International Conference on Programming Languages Design and Implementation. PLDI \u201993 (pp. 248\u2013257).","DOI":"10.1145\/155090.155114"},{"key":"22_CR242","doi-asserted-by":"crossref","unstructured":"Rawat, P. S., et al. (2018). Register optimizations for stencils on GPUs. In Proceedings of the Symposium on Principles and Practice of Parallel Programming. PPoPP \u201918 (pp. 168\u2013182).","DOI":"10.1145\/3178487.3178500"},{"key":"22_CR252","doi-asserted-by":"crossref","unstructured":"Sarkar, V., & Barik, R. (2007). Extended linear scan: an alternate foundation for global register allocation. In International Conference on Compiler Construction. CC \u201907 (pp. 141\u2013155). New York: Springer.","DOI":"10.1007\/978-3-540-71229-9_10"},{"key":"22_CR262","doi-asserted-by":"crossref","unstructured":"Smith, M. D., Ramsey, N., & Holloway, G. H. (2004). A generalized algorithm for graph-coloring register allocation. In International Conference on Programming Languages Design and Implementation. PLDI \u201904 (pp. 277\u2013288).","DOI":"10.1145\/996893.996875"},{"key":"22_CR281","doi-asserted-by":"crossref","unstructured":"Tavares, A. L. C., et al. (2011). Decoupled graph-coloring register allocation with hierarchical aliasing. In Proceedings of the International Workshop on Software & Compilers for Embedded Systems. SCOPES \u201911 (pp. 1\u201310).","DOI":"10.1145\/1988932.1988934"},{"issue":"2","key":"22_CR286","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1142\/S012962640400188X","volume":"14","author":"S Touati","year":"2004","unstructured":"Touati, S., & Eisenbeis, C. (2004). Early periodic register allocation on ILP processors. Parallel Processing Letters, 14(2), 287\u2013313.","journal-title":"Parallel Processing Letters"},{"key":"22_CR301","doi-asserted-by":"crossref","unstructured":"Wang, J., et al. (1994). Software pipelining with register allocation and spilling. In Proceedings of the International Symposium on Microarchitecture. MICRO 27 (pp. 95\u201399).","DOI":"10.1145\/192724.192734"},{"key":"22_CR305","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/1064979.1064998","volume-title":"Proceedings of the 1st ACM\/USENIX International Conference on Virtual Execution Environments","author":"C Wimmer","year":"2005","unstructured":"Wimmer, C., & M\u00f6ssenb\u00f6ck, H. (2005). Optimized interval splitting in a linear scan register allocator. In Proceedings of the 1st ACM\/USENIX International Conference on Virtual Execution Environments (pp. 132\u2013141). Chicago: ACM."}],"container-title":["SSA-based Compiler Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80515-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T20:06:04Z","timestamp":1670529964000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80515-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,12]]},"ISBN":["9783030805142","9783030805159"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80515-9_22","relation":{},"subject":[],"published":{"date-parts":[[2021,6,12]]},"assertion":[{"value":"12 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}