{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T03:55:57Z","timestamp":1769831757632,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540330509","type":"print"},{"value":"9783540330516","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11688839_12","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T07:41:48Z","timestamp":1143531708000},"page":"124-138","source":"Crossref","is-referenced-by-count":24,"title":["Hybrid Optimizations: Which Optimization Algorithm to Use?"],"prefix":"10.1007","author":[{"given":"John","family":"Cavazos","sequence":"first","affiliation":[]},{"given":"J. Eliot B.","family":"Moss","sequence":"additional","affiliation":[]},{"given":"Michael F. P.","family":"O\u2019Boyle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1147\/sj.391.0211","volume":"39","author":"B. Alpern","year":"2000","unstructured":"Alpern, B., Attanasio, C.R., Barton, J.J., Burke, M.G., Cheng, P., Choi, J.-D., Cocchi, A., Fink, S.J., Grove, D., Hind, M., Hummel, S.F., Lieber, D., Litvinov, V., Mergen, M.F., Ngo, T., Russell, J.R., Sarkar, V., Serrano, M.J., Shepherd, J.C., Smith, S.E., Sreedhar, V.C., Srinivasan, H., Whaley, J.: The Jalape\u00f1o virtual machine. IBM Systems Journal\u00a039(1), 211\u2013238 (2000)","journal-title":"IBM Systems Journal"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Appel, A., George, L.: Optimal spilling for CISC machines with few registers. In: Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation, Snowbird, Utah, June 2001, pp. 243\u2013253. Association of Computing Machinery (2001)","DOI":"10.1145\/378795.378854"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/353171.353175","volume-title":"ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA)","author":"M. Arnold","year":"2000","unstructured":"Arnold, M., Fink, S., Grove, D., Hind, M., Sweeney, P.F.: Adaptive optimization in the Jalape\u00f1o JVM. In: ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), Minneapolis, MN, October 2000, pp. 47\u201365. ACM Press, New York (2000)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/73141.74841","volume-title":"SIGPLAN 1989 Conference on Programming Language Design and Implementation","author":"D. Bernstein","year":"1989","unstructured":"Bernstein, D., Goldin, D.Q., Golumbic, M.C., Mansour, Y., Nahshon, I., Pinter, R.Y.: Spill code minimization techniques for optimizing compilers. In: SIGPLAN 1989 Conference on Programming Language Design and Implementation, Portland, Oregon, June 1989, pp. 258\u2013263. ACM Press, New York (1989)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1145\/73141.74843","volume-title":"Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation","author":"P. Briggs","year":"1989","unstructured":"Briggs, P., Cooper, K.D., Kennedy, K., Torczon, L.: Coloring heuristics for register allocation. In: Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, pp. 275\u2013284. ACM Press, New York (1989)"},{"issue":"3","key":"12_CR6","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)"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/996841.996864","volume-title":"Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation","author":"J. Cavazos","year":"2004","unstructured":"Cavazos, J., Moss, J.E.B.: Inducing heuristics to decide whether to schedule. In: Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation, Washington, D.C., June 2004, pp. 183\u2013194. ACM Press, New York (2004)"},{"key":"12_CR8","first-page":"98","volume-title":"Proceedings of the ACM SIGPLAN 1982 Conference on Programming Language Design and Implementation","author":"G.J. Chaitin","year":"1982","unstructured":"Chaitin, G.J.: Register allocation and spilling via graph coloring. In: Proceedings of the ACM SIGPLAN 1982 Conference on Programming Language Design and Implementation, Boston, Massachusetts, June 1982, pp. 98\u2013101. ACM Press, New York (1982)"},{"key":"12_CR9","first-page":"115","volume-title":"Proceedings of the Twelfth International Conference on Machine Learning","author":"W.W. Cohen","year":"1995","unstructured":"Cohen, W.W.: Fast effective rule induction. In: Proceedings of the Twelfth International Conference on Machine Learning, Lake Tahoe CA, November 1995, pp. 115\u2013123. Morgan Kaufmann, San Francisco (1995)"},{"issue":"3","key":"12_CR10","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"},{"key":"12_CR11","first-page":"511","volume-title":"Proceedings of the 17th International Conference on Machine Learning","author":"M.G. Lagoudakis","year":"2000","unstructured":"Lagoudakis, M.G., Littman, M.L.: Algorithm selection using reinforcement learning. In: Proceedings of the 17th International Conference on Machine Learning, Stanford CA, pp. 511\u2013518. Morgan Kaufmann, San Francisco (2000)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-46148-5_5","volume-title":"Artificial Intelligence: Methodology, Systems, and Applications","author":"A. Monsifrot","year":"2002","unstructured":"Monsifrot, A., Bodin, F., Quiniou, R.: A machine learning approach to automatic production of compiler heuristics. In: Scott, D. (ed.) AIMSA 2002. LNCS, vol.\u00a02443, pp. 41\u201350. Springer, Heidelberg (2002)"},{"issue":"5","key":"12_CR13","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1145\/330249.330250","volume":"21","author":"M. Poletto","year":"1999","unstructured":"Poletto, M., Sarkar, V.: Linear scan register allocation. ACM Transactions on Programming Languages and Systems\u00a021(5), 895\u2013913 (1999)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"12_CR14","unstructured":"Standard Performance Evaluation Corporation (SPEC), Fairfax, VA. SPEC JVM 1998 Benchmarks (1998)"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/781131.781141","volume-title":"Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation","author":"M. Stephenson","year":"2003","unstructured":"Stephenson, M., Amarasinghe, S., Martin, M., O\u2019Reilly, U.-M.: Meta optimization: Improving compiler heuristics with machine learning. In: Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation, San Diego, Ca, June 2003, pp. 77\u201390. ACM Press, New York (2003)"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1145\/277650.277714","volume-title":"Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation","author":"O. Traub","year":"1998","unstructured":"Traub, O., Holloway, G., Smith, M.D.: Quality and speed in linear-scan register allocation. In: Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, Montreal, Canada, June 1998, pp. 142\u2013151. ACM Press, New York (1998)"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11688839_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T07:22:42Z","timestamp":1547882562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11688839_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330509","9783540330516"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11688839_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}