{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:45:11Z","timestamp":1725543911954},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642115141"},{"type":"electronic","value":"9783642115158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11515-8_7","type":"book-chapter","created":{"date-parts":[[2010,1,20]],"date-time":"2010-01-20T14:58:47Z","timestamp":1263999527000},"page":"66-80","source":"Crossref","is-referenced-by-count":3,"title":["Split Register Allocation: Linear Complexity Without the Performance Penalty"],"prefix":"10.1007","author":[{"given":"Boubacar","family":"Diouf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrice","family":"Rastello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Cavazos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0096-0551(81)90048-5","volume":"6","author":"G.J. Chaitin","year":"1981","unstructured":"Chaitin, G.J., Auslander, M.A., Cocke, A.K.C.J., Hopkins, M.E., Markstein, P.W.: Register allocation via coloring. Computer languages\u00a06, 47\u201357 (1981)","journal-title":"Computer languages"},{"issue":"3","key":"7_CR2","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 Trans. Program. Lang. Syst.\u00a016(3), 428\u2013455 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1145\/378795.378831","volume-title":"PLDI 2001","author":"C. Krintz","year":"2001","unstructured":"Krintz, C., Calder, B.: Using annotations to reduce dynamic optimization time. In: PLDI 2001, pp. 156\u2013167. ACM Press, New York (2001)"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1147\/sj.442.0399","volume":"44","author":"B. Alpern","year":"2005","unstructured":"Alpern, B., et al.: The Jikes RVM project: Building an open source research community. IBM Systems Journal\u00a044(2), 399\u2013418 (2005)","journal-title":"IBM Systems Journal"},{"issue":"6","key":"7_CR5","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1002\/1096-9128(200005)12:6<389::AID-CPE481>3.0.CO;2-6","volume":"12","author":"J. Jones","year":"2000","unstructured":"Jones, J., Kamin, S.N.: Annotating java class files with virtual registers for performance. Concurrency \u2013 Practice and Experience\u00a012(6), 389\u2013406 (2000)","journal-title":"Concurrency \u2013 Practice and Experience"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Bouchez, F., Darte, A., Rastello, F.: On the complexity of spill everywhere under ssa form. In: LCTES 2007, pp. 103\u2013112 (2007)","DOI":"10.1145\/1254766.1254782"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/11575467_21","volume-title":"Programming Languages and Systems","author":"F.M.Q. Pereira","year":"2005","unstructured":"Pereira, F.M.Q., Palsberg, J.: Register allocation via coloring of chordal graphs. In: Yi, K. (ed.) APLAS 2005. LNCS, vol.\u00a03780, pp. 315\u2013329. Springer, Heidelberg (2005)"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1145\/1167473.1167488","volume-title":"OOPSLA 2006","author":"S.M. Blackburn","year":"2006","unstructured":"Blackburn, S.M.: The dacapo benchmarks: java benchmarking development and analysis. In: OOPSLA 2006, pp. 169\u2013190. ACM, New York (2006)"},{"issue":"10","key":"7_CR9","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1145\/1449955.1449794","volume":"43","author":"A. Georges","year":"2008","unstructured":"Georges, A., Eeckhout, L., Buytaert, D.: Java performance evaluation through rigorous replay compilation. SIGPLAN Not.\u00a043(10), 367\u2013384 (2008)","journal-title":"SIGPLAN Not."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Serrano, M., Bordawekar, R., Midkiff, S., Gupta, M.: Quicksilver: A quasi-static compiler for java. In: OOPSLA 2000 (2000)","DOI":"10.1145\/353171.353176"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Azevedo, A., Nicolau, A., Hummel, J.: Java annotation-aware just-in-time (ajit) compilation system. In: Proc. ACM 1999 Conf. on Java Grande, pp. 142\u2013151 (1999)","DOI":"10.1145\/304065.304115"},{"key":"7_CR12","unstructured":"Lesnicki, P., Cohen, A., Cornero, M., Fursin, G., Ornstein, A., Rohou, E.: Split compilation: an application to just-in-time vectorization. In: GREPS 2007, Brasov, Romania (September 2007)"},{"key":"7_CR13","first-page":"243","volume-title":"PLDI 2001, Snowbird, Utah, USA","author":"A.W. Appel","year":"2001","unstructured":"Appel, A.W., George, L.: Optimal spilling for CISC machines with few registers. In: PLDI 2001, Snowbird, Utah, USA, June 2001, pp. 243\u2013253. ACM Press, New York (2001)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/11688839_20","volume-title":"Compiler Construction","author":"S. Hack","year":"2006","unstructured":"Hack, S., Grund, D., Goos, G.: Register allocation for program s in SSA-form. In: Mycroft, A., Zeller, A. (eds.) CC 2006. LNCS, vol.\u00a03923, pp. 247\u2013262. Springer, Heidelberg (2006)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-540-72521-3_21","volume-title":"Languages and Compilers for Parallel Computing","author":"F. Bouchez","year":"2007","unstructured":"Bouchez, F., Darte, A., Guillon, C., Rastello, F.: Register allocation: What does the NP-completeness proof of Chaitin et al. really prove? In: Alm\u00e1si, G.S., Ca\u015fcaval, C., Wu, P. (eds.) KSEM 2006. LNCS, vol.\u00a04382, pp. 283\u2013298. Springer, Heidelberg (2007)"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/1064979.1064998","volume-title":"VEE 2005","author":"C. Wimmer","year":"2005","unstructured":"Wimmer, C., M\u00f6ssenb\u00f6ck, H.: Optimized interval splitting in a linear scan register allocator. In: VEE 2005, pp. 132\u2013141. ACM, New York (2005)"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-71229-9_10","volume-title":"Compiler Construction","author":"V. Sarkar","year":"2007","unstructured":"Sarkar, V., Barik, R.: Extended linear scan: An alternate foundation for global register allocation. In: Krishnamurthi, S., Odersky, M. (eds.) CC 2007. LNCS, vol.\u00a04420, pp. 141\u2013155. Springer, Heidelberg (2007)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-45306-7_23","volume-title":"Compiler Construction","author":"P. Pominville","year":"2001","unstructured":"Pominville, P., Qian, F., Vall\u00e9e-Rai, R., Hendren, L.J., Verbrugge, C.: A framework for optimizing java using attributes. In: Wilhelm, R. (ed.) CC 2001. LNCS, vol.\u00a02027, pp. 334\u2013354. Springer, Heidelberg (2001)"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/11688839_12","volume-title":"Compiler Construction","author":"J. Cavazos","year":"2006","unstructured":"Cavazos, J., Moss, J.E.B., Boyle, M.F.O.: Hybrid optimizations: Which optimization algorithm to use? In: Mycroft, A., Zeller, A. (eds.) CC 2006. LNCS, vol.\u00a03923, pp. 124\u2013138. Springer, Heidelberg (2006)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Necula, G.: Proof-carrying code. In: PoPL 1997 (January 1997)","DOI":"10.1145\/263699.263712"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Touati, S., Eisenbeis, C.: Early periodic register allocation on ilp processors. Parallel Processing Letters\u00a014(2) (June 2004)","DOI":"10.1142\/S012962640400188X"}],"container-title":["Lecture Notes in Computer Science","High Performance Embedded Architectures and Compilers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11515-8_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:41:40Z","timestamp":1606185700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11515-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642115141","9783642115158"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11515-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}