{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:40Z","timestamp":1750306060394,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,5,15]],"date-time":"2017-05-15T00:00:00Z","timestamp":1494806400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,5,15]]},"DOI":"10.1145\/3075564.3075571","type":"proceedings-article","created":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T12:47:29Z","timestamp":1496839649000},"page":"237-246","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal On-Line Computation of Stack Distances for MIN and OPT"],"prefix":"10.1145","author":[{"given":"Gianfranco","family":"Bilardi","sequence":"first","affiliation":[{"name":"Department of Information Engineering, University of Padova, Padova, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kattamuri","family":"Ekanadham","sequence":"additional","affiliation":[{"name":"IBM T.J.Watson Research Center, Yortktown, Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pratap","family":"Pattnaik","sequence":"additional","affiliation":[{"name":"IBM T.J.Watson Research Center, Yortktown, Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,5,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28428"},{"key":"e_1_3_2_1_2_1","volume-title":"Ullman","author":"Aho A. V.","year":"1974","unstructured":"Aho , A. V. , Hopcroft , J.E. , Ullman , J.D. : The design and analysis of computer algorithms. Addison-Wesley ( 1974 ) Aho, A. V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley (1974)"},{"key":"e_1_3_2_1_3_1","volume-title":"Kennedy","author":"Allen R.","year":"2002","unstructured":"Allen , R. , Kennedy , K. : Optimizing compilers for modern architectures. Morgan Kauffman ( 2002 ) Allen, R., Kennedy, K.: Optimizing compilers for modern architectures. Morgan Kauffman (2002)"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/773146.773043"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.52.0078"},{"key":"e_1_3_2_1_6_1","first-page":"577","volume":"3","author":"Belady L.A.","year":"1971","unstructured":"Belady , L.A. : On -line systems for measuring the efficiency of replacement algorithms. US Patent 3 , 577 ,185 ( 1971 ) Belady, L.A.: On-line systems for measuring the efficiency of replacement algorithms. US Patent 3,577,185 (1971)","journal-title":"US Patent"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.181.0002"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.194.0353"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808735"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1552285.1552288"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-012-0200-2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.01.016"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00154-5"},{"key":"e_1_3_2_1_14_1","volume-title":"El-Yaniv","author":"Borodin A","year":"1998","unstructured":"Borodin , A , El-Yaniv , R. : Online computation and competitive analysis Cambridge University Press , Cambridge UK ( 1998 ) Borodin, A, El-Yaniv, R.: Online computation and competitive analysis Cambridge University Press, Cambridge UK (1998)"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(95)00021-B"},{"key":"e_1_3_2_1_16_1","volume-title":"Stein, C: Introduction to algorithms","author":"Cormen T.H.","year":"2009","unstructured":"Cormen , T.H. , Leiserson , C.E. , Rivest , R.L. , Stein, C: Introduction to algorithms ( third edition). The MIT Press ( 2009 ) Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C: Introduction to algorithms (third edition). The MIT Press (2009)"},{"key":"e_1_3_2_1_17_1","volume-title":": Real time generation of MIN distance strings. Computer Science Department","author":"Denning P.J.","year":"1976","unstructured":"Denning , P.J. : Real time generation of MIN distance strings. Computer Science Department , Purdue University CSD TR - 211, November 1976 . Denning, P.J.: Real time generation of MIN distance strings. Computer Science Department, Purdue University CSD TR - 211, November 1976."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90026-0"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/366786.366800"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. 16th International Workshop on Languages and Compilers for Parallel Computing","author":"Guo J.","year":"2003","unstructured":"Guo , J. , Garzar\u00e1n , M.J. , Padua , D. : The power of Belady's algorithm in register allocation for long basic blocks . Proc. 16th International Workshop on Languages and Compilers for Parallel Computing , ( 2003 ), 374--390 Guo, J., Garzar\u00e1n, M.J., Padua, D.: The power of Belady's algorithm in register allocation for long basic blocks. Proc. 16th International Workshop on Languages and Compilers for Parallel Computing, (2003), 374--390"},{"key":"e_1_3_2_1_21_1","volume-title":"Patterson","author":"Hennessy J.L.","year":"2006","unstructured":"Hennessy , J.L. , Patterson , D.A. : Computer architecture: a quantitative approach. Morgan Kauffman ( 2006 ) Hennessy, J.L., Patterson, D.A.: Computer architecture: a quantitative approach. Morgan Kauffman (2006)"},{"key":"e_1_3_2_1_22_1","volume":"4758","author":"Lewis C.H.","year":"1974","unstructured":"Lewis , C.H. , Nelson , R.A. : Some one-pass algorithms for the generation of OPT distance strings. IBM T.J. Watson Research Center RC 4758 , March 1974 . Lewis, C.H., Nelson, R.A.: Some one-pass algorithms for the generation of OPT distance strings. IBM T.J. Watson Research Center RC 4758, March 1974.","journal-title":"IBM T.J. Watson Research Center RC"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90034-Y"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.92.0078"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(82)90012-0"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4259"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Przybylski S.: Cache and memory hierarchy design. A performance directed approach. Morgan Kaufmann Palo Alto CA (1990)   Przybylski S.: Cache and memory hierarchy design. A performance directed approach. Morgan Kaufmann Palo Alto CA (1990)","DOI":"10.1016\/B978-0-08-050059-1.50009-8"},{"key":"e_1_3_2_1_28_1","volume-title":"Models of computation. Exploring the power of computing","author":"Savage J.","year":"1997","unstructured":"Savage , J. : Models of computation. Exploring the power of computing . Addison-Wesley , Reading, MA ( 1997 ) Savage, J.: Models of computation. Exploring the power of computing. Addison-Wesley, Reading, MA (1997)"},{"key":"e_1_3_2_1_29_1","volume-title":"Operating system concepts","author":"Silberschatz A","year":"2005","unstructured":"Silberschatz , A , Galvin , P.B. , Gagne , G. : Operating system concepts . Wiley ( 2005 ) Silberschatz, A, Galvin, P.B.,Gagne, G.: Operating system concepts. Wiley (2005)"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1479992.1480078"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/166955.166974"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.11.009"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.12.001"},{"key":"e_1_3_2_1_35_1","volume-title":"High performance compilers for parallel computing","author":"Wolfe M.","year":"1995","unstructured":"Wolfe , M. : High performance compilers for parallel computing . Addison-Wesley ( 1995 ) Wolfe, M.: High performance compilers for parallel computing. Addison-Wesley (1995)"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63495"}],"event":{"name":"CF '17: Computing Frontiers Conference","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"],"location":"Siena Italy","acronym":"CF '17"},"container-title":["Proceedings of the Computing Frontiers Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3075564.3075571","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3075564.3075571","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:03:42Z","timestamp":1750215822000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3075564.3075571"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,15]]},"references-count":36,"alternative-id":["10.1145\/3075564.3075571","10.1145\/3075564"],"URL":"https:\/\/doi.org\/10.1145\/3075564.3075571","relation":{},"subject":[],"published":{"date-parts":[[2017,5,15]]},"assertion":[{"value":"2017-05-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}