{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:38:29Z","timestamp":1725493109246},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440499"},{"type":"electronic","value":"9783540457060"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45706-2_34","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T01:37:18Z","timestamp":1191721038000},"page":"255-264","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Tiling and Memory Reuse for Sequences of Nested Loops"],"prefix":"10.1007","author":[{"given":"Youcef","family":"Bouchebaba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabien","family":"Coelho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,20]]},"reference":[{"key":"34_CR1","unstructured":"Youcef Bouchebaba and Fabien Coelho. Buffered tiling for sequences of loops nests. In Compilers and Operating Systems for Low Power 2001."},{"key":"34_CR2","unstructured":"Youcef Bouchebaba and Fabien Coelho. Pavage pour une s\u00e9quence de nids de boucles. To appear in Technique et science informatiques, 2000."},{"key":"34_CR3","unstructured":"F. Cathoor and al. Custom memory management methodology-Exploration of memory organisation for embedded multimedia system design. Kluwer Academic Publishers, 1998."},{"issue":"9","key":"34_CR4","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1016\/S0167-8191(00)00034-X","volume":"26","author":"A. Darte","year":"2000","unstructured":"Alain Darte. On the complexity of loop fusion. Parallel Computing, 26(9):1175\u20131193, 2000.","journal-title":"Parallel Computing"},{"issue":"5","key":"34_CR5","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1023\/A:1007506711786","volume":"28","author":"A. Darte","year":"2000","unstructured":"Alain Darte and Guillaume Huard. Loop shifting for loop compaction. International Journal of Parallel Programming, 28(5):499\u2013534, 2000.","journal-title":"International Journal of Parallel Programming"},{"key":"34_CR6","unstructured":"C. Eisenbeis, W. Jalby, D. Windheiser, and F. Bodin. A strategy for array management in local memory. rapport de recherche 1262, INRIA, 1990."},{"key":"34_CR7","unstructured":"Equipe PIPS. Pips (interprocedural parallelizer for scientific programs) rs http:\/\/www.cri.ensmp.fr\/pips URL."},{"issue":"10","key":"34_CR8","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/0743-7315(88)90014-7","volume":"5","author":"D. Gannon","year":"1988","unstructured":"D. Gannon, W. Jalby, and K. Gallivan. Strategies for cache and local memory management by global program transformation. Journal of Parallel and Distibuted Computing, 5(10):587\u2013616, 1988.","journal-title":"Journal of Parallel and Distibuted Computing"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"F. Irigoin and R. Triolet. Supernode partitioning. In Proceedings of 15th Annual ACM Symposium on Principles of Programming Languages, pages 319\u2013329, San Diego, CA, 1988.","DOI":"10.1145\/73560.73588"},{"key":"34_CR10","unstructured":"N. Museux. Aide au placement d\u2019applications de traitement du signal sur machines parall\u00e8les multi-spmd. Phd thesis, \u00c9cole Nationale Sup\u00e9rieure des Mines de Paris, 2001."},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"W. Pugh and E. Rosser. Iteration space slicing for locality. In LCPC99, pages 165\u2013184, San Diego, CA, 1999.","DOI":"10.1007\/3-540-44905-1_11"},{"issue":"5","key":"34_CR12","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1023\/A:1007554627716","volume":"28","author":"F. Quiller\u00e9","year":"2000","unstructured":"F. Quiller\u00e9, S. Rajopadhye, and D. Wild. Generation of efficient nested loops from polyhedra. International journal of parallel programming, 28(5):496\u2013498, 2000.","journal-title":"International journal of parallel programming"},{"issue":"5","key":"34_CR13","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1145\/365151.365152","volume":"22","author":"F. Quiller\u00e9","year":"2000","unstructured":"Fabien Quiller\u00e9 and Sanjay Rajopadhye. Optimizing memory usage in the polyhedral model. Transactions on Programming Languages and Systems, 22(5):773\u2013815, 2000.","journal-title":"Transactions on Programming Languages and Systems"},{"issue":"4","key":"34_CR14","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1023\/A:1018754616274","volume":"26","author":"M. Wolf","year":"1998","unstructured":"M. Wolf, D. Maydan, and Ding-Kai-Chen. Combining loop transformations considering caches and scheduling. International Journal of Parallel Programming, 26(4):479\u2013503, 1998.","journal-title":"International Journal of Parallel Programming"},{"key":"34_CR15","unstructured":"M. E. Wolf. Improving locality and parallelism in nested loops. Phd thesis, University of stanford, 1992."},{"issue":"4","key":"34_CR16","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1142\/S0129626497000401","volume":"7","author":"J. Xue","year":"1997","unstructured":"J. Xue. On tiling as a loop transformation. Parallel Processing Letters, 7(4):409\u2013424, 1997.","journal-title":"Parallel Processing Letters"},{"key":"34_CR17","unstructured":"H. P. Zima and B. M. Chapman. Supercompilers for parallel and vector computers, volume 1. Addison-Wesley, 1990."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2002 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45706-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T20:19:57Z","timestamp":1587327597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45706-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440499","9783540457060"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45706-2_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"20 August 2002","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"}]}}