{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:08:15Z","timestamp":1775052495002,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Supercomputing"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1023\/a:1013535431127","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T16:58:59Z","timestamp":1040662739000},"page":"37-76","source":"Crossref","is-referenced-by-count":23,"title":["Precise Data Locality Optimization of Nested Loops"],"prefix":"10.1007","volume":"21","author":[{"given":"Vincent","family":"Loechner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beno\u00eet","family":"Meister","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Clauss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"391685_CR1","volume-title":"Compilers: Principles, Techniques and Tools","author":"A. Aho","year":"1987","unstructured":"A. Aho, R. Sethi, and J. Ullman. Compilers: Principles, Techniques and Tools. Addison Wesley, Reading, Mass., 1987."},{"key":"391685_CR2","doi-asserted-by":"crossref","unstructured":"J. M. Anderson, S. P. Amarasinghe, and M. S. Lam. Data and computation transformations for multiprocessors. In A. Press, ed., Proceedings, Principles and Practice of Parallel Programming, 1995.","DOI":"10.1145\/209936.209954"},{"key":"391685_CR3","unstructured":"U. Banerjee. Unimodular transformations of double loops. In Advances in Languages and Compilers for Parallel Processing, 1991."},{"key":"391685_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/b102311","volume-title":"Loop Transformations for Restructuring Compilers\u2014The Foundations","author":"U. Banerjee","year":"1993","unstructured":"U. Banerjee. Loop Transformations for Restructuring Compilers\u2014The Foundations. Kluwer Academic Publishers, Norwell, Mass., 1993."},{"key":"391685_CR5","doi-asserted-by":"crossref","unstructured":"S. Chatterjee, V. V. Jain, A. R. Lebeck, and S. Mundhra. Nonlinear array layouts for hierarchical memory systems. In Proceedings of the ACM International Conference on Supercomputing, Rhodes, Greece, 1999.","DOI":"10.1145\/305138.305231"},{"key":"391685_CR6","doi-asserted-by":"crossref","unstructured":"M. Cierniak and W. Li. Unifying data and control transformations for distributed shared-memory machines. In Proceedings Programming Language Design and Implementation, 1995.","DOI":"10.1145\/207110.207145"},{"key":"391685_CR7","doi-asserted-by":"crossref","unstructured":"P. Clauss. Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: applications to analyze and transform scientific programs. In 10th ACM International Conference on Supercomputing, Philadelphia, 1996.","DOI":"10.1145\/237578.237617"},{"key":"391685_CR8","doi-asserted-by":"crossref","unstructured":"P. Clauss. Handling memory cache policy with integer points countings. In Euro-Par'97, Passau, pp. 285\u2013293, 1997.","DOI":"10.1007\/BFb0002746"},{"key":"391685_CR9","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1023\/A:1008069920230","volume":"19","author":"P. Clauss","year":"1998","unstructured":"P. Clauss and V. Loechner. Parametric analysis of polyhedral iteration spaces. Journal of VLSI Signal Processing, 19: 179\u2013194, 1998.","journal-title":"Journal of VLSI Signal Processing"},{"key":"391685_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-61736-1_44","volume-title":"The Data Parallel Programming Model","author":"P. Feautrier","year":"1996","unstructured":"P. Feautrier. Automatic parallelization in the polytope model. In G.-R. Perrin and A. Darte, eds. The Data Parallel Programming Model, Vol. 1132 of Lecture Notes in Computer Science, pp. 79-100. Springer-Verlag, Berlin, 1996."},{"key":"391685_CR11","unstructured":"Y.-J. Ju. and H. Dietz. Reduction of cache coherence overhead by compiler data layout and loop transformations. In Proceedings of the 4th International Workshop on Languages and Compilers for Parallel Computing, 1992."},{"key":"391685_CR12","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1006\/jpdc.1999.1552","volume":"58","author":"M. Kandemir","year":"1999","unstructured":"M. Kandemir, A. Choudhary, J. Ramanujam, and P. Banerjee. A matrix-based approach to global locality optimization. Journal of Parallel and Distributed Computing, 58: 190\u2013235, 1999.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"391685_CR13","unstructured":"M. Lam, E. Rothberg, and M. Wolf. The cache performance of blocked algorithms. In International Conference on ASPLOS, 1991."},{"key":"391685_CR14","unstructured":"S.-T. Leung and J. Zahorjan. Optimizing data locality by array restructuring. Technical Report 95-09-01, University of Washington, Department of Computer Science and Engineering, 1995."},{"key":"391685_CR15","volume-title":"Compiling for NUMA parallel machines","author":"W. Li","year":"1993","unstructured":"W. Li. Compiling for NUMA parallel machines. Ph.D. thesis, Department of Computer Science, Cornell University, Ithaca, NY, 1993."},{"key":"391685_CR16","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1023\/A:1025117523902","volume":"25","author":"V. Loechner","year":"1997","unstructured":"V. Loechner and D. K. Wilde. Parameterized polyhedra and their Vertices. International Journal of Parallel Programming, 25: 525\u2013549, 1997.","journal-title":"International Journal of Parallel Programming"},{"key":"391685_CR17","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1018744411700","volume":"27","author":"M. O'Boyle","year":"1999","unstructured":"M. O'Boyle and P. Knijnenburg. Nonsingular data transformations: definition, validity, and applications. International Journal of Parallel Programming, 27: 131\u2013159, 1999.","journal-title":"International Journal of Parallel Programming"},{"key":"391685_CR18","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1023\/A:1007554627716","volume":"28","author":"F. Quiller\u00e9","year":"2000","unstructured":"F. Quiller\u00e9, S. Rajopadhye, and D. Wilde. Generation of efficient nested loops from polyhedra. International Journal of Parallel Programming, 28: 469\u2013498, 2000.","journal-title":"International Journal of Parallel Programming"},{"key":"391685_CR19","volume-title":"Low Power Design Methodologies","author":"J. M. Rabaey","year":"1995","unstructured":"J. M. Rabaey and M. Pedram. Low Power Design Methodologies. Kluwer Academic Publishers, Norwell, Mass., 1995."},{"key":"391685_CR20","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver. Theory of Linear and Integer Programming. John Wiley and Sons, New York, 1986."},{"key":"391685_CR21","doi-asserted-by":"crossref","unstructured":"M. R. Swanson, L. Stoller, and J. Carter. Increasing TLB reach using superpages backed by shadow memory. In Proceedings of the 25th Annual International Symposium on Computer Architecture, pp. 204\u2013213, 1998.","DOI":"10.1109\/ISCA.1998.694775"},{"key":"391685_CR22","volume-title":"A library for doing polyhedral operations","author":"D. Wilde","year":"1993","unstructured":"D. Wilde. A library for doing polyhedral operations. Master's thesis, Oregon State University, Corvallis, 1993."},{"key":"391685_CR23","doi-asserted-by":"crossref","unstructured":"M. Wolf and M. Lam. A data locality optimizing algorithm. In Proceedings of ACM SIGPLAN 91 Conference Programming Language Design and Implementation, Toronto, Ont., pp. 30\u201344, 1991.","DOI":"10.1145\/113445.113449"},{"key":"391685_CR24","doi-asserted-by":"crossref","unstructured":"M. Wolfe. More iteration space tiling. In Proceedings of Supercomputing'89, pp. 655\u2013664, 1989.","DOI":"10.1145\/76263.76337"},{"key":"391685_CR25","volume-title":"High Performance Compilers for Parallel Computing","author":"M. Wolfe","year":"1996","unstructured":"M. Wolfe. High Performance Compilers for Parallel Computing. Addison Wesley, Reading, Mass., 1996."}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013535431127.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013535431127\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013535431127.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:23:49Z","timestamp":1754630629000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013535431127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["391685"],"URL":"https:\/\/doi.org\/10.1023\/a:1013535431127","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}