{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:33:16Z","timestamp":1742398396163},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407966"},{"type":"electronic","value":"9783540452133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45213-3_26","type":"book-chapter","created":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T21:44:48Z","timestamp":1283550288000},"page":"202-213","source":"Crossref","is-referenced-by-count":5,"title":["Graph Coloring vs. Optimal Register Allocation for Optimizing Compilers"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Hirnschrott","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Krall","sequence":"additional","affiliation":[]},{"given":"Bernhard","family":"Scholz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"26_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1145\/74818.74843","volume":"24","author":"K.D.C.P. Briggs","year":"1989","unstructured":"Briggs, K.D.C.P., Kennedy, K., Torczon, L.: Coloring heuristics for register allocation. SIGPLAN Notices\u00a024(7), 275\u2013284 (1989)","journal-title":"SIGPLAN Notices"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/130616.130617","volume":"1","author":"P. Briggs","year":"1992","unstructured":"Briggs, P., Cooper, K.D., Torczon, L.: Coloring register pairs. ACM Letters on Programming Languages and Systems (LOPLAS)\u00a01(1), 3\u201313 (1992)","journal-title":"ACM Letters on Programming Languages and Systems, (LOPLAS)"},{"issue":"3","key":"26_CR3","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1145\/177492.177575","volume":"16","author":"P. Briggs","year":"1994","unstructured":"Briggs, P., Cooper, K.D., Torczon, L.: Improvements to graph coloring register allocation. ACM Transactions on Programming Languages and Systems (TOPLAS)\u00a016(3), 428\u2013455 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"issue":"6","key":"26_CR4","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/872726.806984","volume":"17","author":"G.J. Chaitin","year":"1982","unstructured":"Chaitin, G.J.: Register allocation and spilling via graph coloring. ACM SIGPLAN Notices\u00a017(6), 98\u2013105 (1982)","journal-title":"ACM SIGPLAN Notices"},{"issue":"4","key":"26_CR5","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/88616.88621","volume":"12","author":"F.C. Chow","year":"1990","unstructured":"Chow, F.C., Hennessy, J.L.: The priority-based coloring approach to register allocation. ACM Transactions on Programming Languages and Systems\u00a012(4), 501\u2013536 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"26_CR6","first-page":"245","volume-title":"Proceedings of the 35st Annual ACM\/IEEE International Symposium on Microarchitecture (MICRO 2002)","author":"C. Fu","year":"2002","unstructured":"Fu, C., Wilken, K.D.: A faster optimal register allocator. In: Proceedings of the 35st Annual ACM\/IEEE International Symposium on Microarchitecture (MICRO 2002), Istanbul, November 18\u201322, pp. 245\u2013256. IEEE Computer Society, Los Alamitos (2002)"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/229542.229546","volume":"18","author":"L. George","year":"1996","unstructured":"George, L., Appel, A.W.: Iterated register coalescing. ACM Transactions on Programming Languages and Systems\u00a018(3), 300\u2013324 (1996)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"8","key":"26_CR8","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1002\/(SICI)1097-024X(199608)26:8<929::AID-SPE40>3.0.CO;2-T","volume":"26","author":"D.W. Goodwin","year":"1996","unstructured":"Goodwin, D.W., Wilken, K.D.: Optimal and near-optimal global register allocation using 0-1 integer programming. Software & Practice and Experience\u00a026(8), 929\u2013965 (1996)","journal-title":"Software & Practice and Experience"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1109\/MICRO.1998.742791","volume-title":"Proceedings of the 31st Annual ACM\/IEEE International Symposium on Microarchitecture (MICRO 1998)","author":"T. Kong","year":"1998","unstructured":"Kong, T., Wilken, K.D.: Precise register allocation for irregular register architectures. In: Proceedings of the 31st Annual ACM\/IEEE International Symposium on Microarchitecture (MICRO 1998), Los Alamitos, November 30\u2013December 2, pp. 297\u2013307. IEEE Computer Society, Los Alamitos (1998)"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1109\/PACT.1998.727246","volume-title":"Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques (PACT 1998)","author":"J. Park","year":"1998","unstructured":"Park, J., Moon, S.-M.: Optimistic register coalescing. In: Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques (PACT 1998), Paris, France, October 12\u201318, pp. 196\u2013204. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"26_CR11","volume-title":"Proceedings of the International Conference of Languages, Compilers and Tools for Embedded Systems (LCTES 2002) and SCOPES 2002","author":"B. Scholz","year":"2002","unstructured":"Scholz, B., Eckstein, E.: Register allocation for irregular register architectures. In: Proceedings of the International Conference of Languages, Compilers and Tools for Embedded Systems (LCTES 2002) and SCOPES 2002, Berlin, June 2002, ACM, New York (2002)"},{"key":"26_CR12","unstructured":"Smith, M.D., Holloway, G.: Graph-coloring register allocation for irregular architectures. Technical report, Harvard University (2000)"}],"container-title":["Lecture Notes in Computer Science","Modular Programming Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45213-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T17:40:39Z","timestamp":1553017239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45213-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407966","9783540452133"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45213-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}