{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:20:59Z","timestamp":1737436859135,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424956"},{"type":"electronic","value":"9783540446811"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44681-8_37","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T03:35:09Z","timestamp":1188358509000},"page":"254-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Cache Models for Iterative Compilation"],"prefix":"10.1007","author":[{"given":"Peter M. W.","family":"Knijnenburg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toru","family":"Kisuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyle","family":"Gallivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"J. Auslander, M. Philipose, Chambers, S. J. Eggers, and N. Bershad. Fast, effective dynamic compilation. In Proc. PLDI, pages 149\u2013159, 1996.","DOI":"10.1145\/249069.231409"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"J. Bilmes, K. Asanovi\u0107, C. W. Chin, and J. Demmel. Optimizing matrix multiply using PHiPAC: A portable, high-performance, ANSI C coding methodology. In Proc. ICS, pages 340\u2013347, 1997.","DOI":"10.1145\/263580.263662"},{"key":"37_CR3","unstructured":"F. Bodin, T. Kisuki, P. M. W. Knijnenburg, M. F. P. O\u2019Boyle, and E. Rohou. Iterative compilation in a non-linear optimisation space. In Proc. Workshop on Profile and Feedback Directed Compilation, 1998."},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"S. Carr. Combining optimization for cache and instruction level parallelism. In Proc. PACT, pages 238\u2013247, 1996.","DOI":"10.1109\/PACT.1996.552672"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"S. Coleman and K. S. McKinley. Tile size selection using cache organization and data layout. In Proc. PLDI, pages 279\u2013290, 1995.","DOI":"10.1145\/223428.207162"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"P. Diniz and M. Rinard. Dynamic feedback: An effective technique for adaptive computing. In Proc. PLDI, pages 71\u201384, 1997.","DOI":"10.1145\/258916.258923"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"T. Kisuki, P. M. W. Knijnenburg, and M. F. P. O\u2019Boyle. Combined selection of tile sizes and unroll factors using iterative compilation. In Proc. PACT, pages 237\u2013246, 2000.","DOI":"10.1109\/PACT.2000.888348"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"M. S. Lam, E. E. Rothberg, and M. E. Wolf. The cache performance and optimizations of blocked algorithms. In Proc. ASPLOS, pages 63\u201374, 1991.","DOI":"10.1145\/106974.106981"},{"key":"37_CR9","unstructured":"B. Singer and M. Veloso. Learning to predict performance from formula modeling and training data. In Proc. Conf. on Machine Learning, 2000."},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"M. D. Smith. Overcoming the challenges to feedback-directed optimization. In Proc. Dynamo, 2000.","DOI":"10.1145\/351397.351408"},{"key":"37_CR11","unstructured":"M. J. Voss and R. Eigenmann. ADAPT: Automated de-coupled adaptive program transformation. In Proc. ICPP, 2000."},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"R. C. Whaley and J. J. Dongarra. Automatically tuned linear algebra software. In Proc. Alliance, 1998.","DOI":"10.1109\/SC.1998.10004"},{"issue":"4","key":"37_CR13","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1023\/A:1018754616274","volume":"26","author":"M. E. Wolf","year":"1998","unstructured":"M. E. Wolf, D. E. Maydan, and D.-K. Chen. Combining loop transformations considering caches and scheduling. Int\u2019l. J. of Parallel Programming, 26(4):479\u2013503, 1998.","journal-title":"Int\u2019l. J. of Parallel Programming"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2001 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44681-8_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:34:02Z","timestamp":1737398042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44681-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424956","9783540446811"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44681-8_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"17 August 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}