{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T19:16:01Z","timestamp":1729624561298,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/asap.2003.1212826","type":"proceedings-article","created":{"date-parts":[[2004,3,2]],"date-time":"2004-03-02T02:26:50Z","timestamp":1078194410000},"page":"17-27","source":"Crossref","is-referenced-by-count":19,"title":["Multi-dimensional incremental loop fusion for data locality"],"prefix":"10.1109","author":[{"given":"S.","family":"Verdoolaege","sequence":"first","affiliation":[]},{"given":"M.","family":"Bruynooghe","sequence":"additional","affiliation":[]},{"given":"G.","family":"Janssens","sequence":"additional","affiliation":[]},{"given":"P.","family":"Catthoor","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(97)00089-6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407835"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISSS.1999.814263"},{"article-title":"Parallelization of loop nests with general bounds in the polyhedron model","year":"1997","author":"geigl","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/4.535411"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01130402","article-title":"Design of a low power video decompression chip set for portable applications","volume":"13","author":"gordon","year":"1996","journal-title":"Journal of VLSI Signal Processing"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2001.970571"},{"key":"ref17","first-page":"301","article-title":"Maximizing loop parallelism and improving data locality via loop fusion and distribution","author":"kennedy","year":"1993","journal-title":"LCPC '93"},{"key":"ref18","first-page":"201","article-title":"Maximizing parallelism and minimizing synchronization with affine trans-forms","author":"lim","year":"1997","journal-title":"Proceedings of the Twenty-fourth Annual ACM Symposium on the Principles of Programming Languages"},{"key":"ref19","first-page":"3","article-title":"Blocking and array contraction across arbitrarily nested loops using affine partitioning","volume":"(7)","author":"lim","year":"2001","journal-title":"ACM SIGPLAN Notices 36"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.1999.807510"},{"key":"ref27","first-page":"201","article-title":"Minimal data dependence abstractions for loop transformations","author":"yang","year":"1994","journal-title":"Languages and Compilers for Parallel Computing"},{"journal-title":"Loop Transformations for Data Transfer and Storage Reduction on Multiprocessor Systems","year":"2001","author":"danckaert","key":"ref3"},{"key":"ref6","first-page":"359","article-title":"New results on array contraction","author":"darte","year":"2002","journal-title":"ASAP"},{"key":"ref5","first-page":"179","article-title":"Complexity of multi-dimensional loop alignment","author":"darte","year":"2002","journal-title":"STAGS"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626497000383"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1105"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(98)00020-9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025168022993"},{"key":"ref1","first-page":"617","article-title":"and E. D'Hollander. Reuse distance as a metric for cache behavior","author":"beyls","year":"2001","journal-title":"lASTED conference on Parallel and Distributed Computinq and Systems 2001 (PDCS01)"},{"key":"ref20","article-title":"Fusion of loops for parallelism and locality","author":"manjikian","year":"1995","journal-title":"Technical Report CSRI-315 Computer Systems Research Institute"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.1023\/A:1007554627716","article-title":"Generation of efficient nested loops from polyhedra","volume":"28","author":"quiller\u00e9","year":"2000","journal-title":"International Journal of Parallel Programming"},{"key":"ref21","article-title":"Collective analysis and transformation of loop clusters","author":"olsen","year":"1992","journal-title":"Technical Report ACAPS Technical Memo 24 McGill University"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/VLSISP.1992.641071"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/377792.377806"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/113445.113449"},{"key":"ref25","article-title":"Feasibility of incremental translation","author":"verdoolaege","year":"2002","journal-title":"Report CW435 Department of Computer Science"}],"event":{"name":"IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003","acronym":"ASAP-03","location":"The Hague, Netherlands"},"container-title":["Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8604\/27271\/01212826.pdf?arnumber=1212826","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T04:04:50Z","timestamp":1497585890000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1212826\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/asap.2003.1212826","relation":{},"subject":[]}}