{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:46:24Z","timestamp":1748335584407,"version":"3.41.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":["International Journal of Parallel Programming"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1023\/a:1011172104768","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T08:43:03Z","timestamp":1040632983000},"page":"319-364","source":"Crossref","is-referenced-by-count":11,"title":["Data-Centric Transformations for Locality Enhancement"],"prefix":"10.1007","volume":"29","author":[{"given":"Induprakas","family":"Kodukula","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keshav","family":"Pingali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"301720_CR1","unstructured":"G. Golub and C. Van Loan, Matrix Computations, Johns Hopkins University Press (1996)."},{"key":"301720_CR2","unstructured":"E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov, and D. Sorensen, (eds.), LAPACK Users' Guide, Second Edition, SIAM, Philadelphia (1995)."},{"key":"301720_CR3","unstructured":"U. Banerjee, Unimodular Transformations of Double Loops, Proc. Workshop Adv. Lang. Compilers for Parallel Processing, pp. 192-219 (August 1990)."},{"key":"301720_CR4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0167-9260(94)90019-1","volume":"17","author":"P. Boulet","year":"1994","unstructured":"P. Boulet, A. Darte, T. Risset, and Y. Robert, (Pen)-Ultimate Tiling? INTEGRATION, VLSI J., 17:33-51 (1994).","journal-title":"INTEGRATION, VLSI J."},{"key":"301720_CR5","doi-asserted-by":"crossref","unstructured":"S. Carr and R. B. Lehoucq, Compiler Blockability of Dense Matrix Factorizations. Technical Report, Argonne National Laboratory (October 1996).","DOI":"10.1145\/275323.275325"},{"key":"301720_CR6","unstructured":"L. Carter, J. Ferrante, and S. Flynn Hummel, Hierarchical Tiling for Improved Super-scalar Performance, Int'l. Parallel Processing Symp. (April 1995)."},{"key":"301720_CR7","unstructured":"J. Dongarra and R. Schreiber, Automatic Blocking of Nested Loops. Technical Report UT-CS-90-108, Department of Computer Science, University of Tennessee (May 1990)."},{"key":"301720_CR8","doi-asserted-by":"crossref","unstructured":"F. Irigoin and R. Triolet, Supernode Partitioning, ACM Symp. Principles of Progr. Lang., pp. 319-329 (January 1988).","DOI":"10.1145\/73560.73588"},{"key":"301720_CR9","doi-asserted-by":"crossref","unstructured":"W. Li and K. Pingali, Access Normalization: Loop Restructuring for NUMA Compilers, ACM Trans. Computer Syst. (1993).","DOI":"10.1145\/143365.143541"},{"issue":"2","key":"301720_CR10","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0743-7315(92)90027-K","volume":"16","author":"J. Ramanujam","year":"1992","unstructured":"J. Ramanujam and P. Sadayappan, Tiling Multidimensional Iteration Spaces for Multicomputers, J. Parallel and Distributed Computing, 16(2):108-120 (October 1992).","journal-title":"J. Parallel and Distributed Computing"},{"key":"301720_CR11","unstructured":"V. Sarkar, Automatic Selection of High-Order Transformations in the IBM ASTI Optimizer. Technical Report ADTI-96-004, Application Development Technology Institute, IBM Software Solutions Division (July 1996). Submitted to special issue of IBM Journal of Research and Development."},{"key":"301720_CR12","doi-asserted-by":"crossref","unstructured":"M. E. Wolf and M. S. Lam, A Data Locality Optimizing Algorithm, SIGPLAN Conf. Progr. Lang. Design Implementation (June 1991).","DOI":"10.1145\/113445.113449"},{"key":"301720_CR13","unstructured":"M. Wolfe, Iteration Space Tiling for Memory Hierarchies, Third SIAM Conf. Parallel Processing for Scientific Computing (December 1987)."},{"key":"301720_CR14","doi-asserted-by":"crossref","unstructured":"M. E. Wolf, D. E. Maydan, and D.-K. Chen, Combining Loop Transformations Considering Caches and Scheduling, MICRO 29, Silicon Graphics, Mountain View, California, pp. 274-286 (1996).","DOI":"10.1109\/MICRO.1996.566468"},{"key":"301720_CR15","unstructured":"R. C. Agarwal and F. G. Gustavson, Algorithm and Architecture Aspects of Producing ESSL BLAS on POWER2."},{"key":"301720_CR16","unstructured":"M. Wolfe, High Performance Compilers for Parallel Computing, Addison-Wesley Publishing Company (1995)."},{"key":"301720_CR17","unstructured":"U. Banerjee, Unimodular Transformations of Double Loops, Lang. and Compilers for Parallel Computing, pp. 192-219 (1990)."},{"key":"301720_CR18","doi-asserted-by":"crossref","unstructured":"M. S. Lam, E. E. Rothberg, and M. E. Wolf, The Cache Performance and Optimizations of Blocked Algorithms, Proc. Fourth Int'l. Conf. Architectural Support Progr. Lang. Oper. Syst., pp. 63-74, Santa Clara, California, ACM SIGARCH, SIGPLAN, SIGOPS, and the IEEE Computer Society (April 1991).","DOI":"10.1145\/106974.106981"},{"key":"301720_CR19","doi-asserted-by":"crossref","unstructured":"W. Li and K. Pingali, A Singular Loop Transformation Based on Nonsingular Matrices, IJPP, 22(2) (April 1994).","DOI":"10.1007\/BF02577874"},{"key":"301720_CR20","doi-asserted-by":"crossref","unstructured":"S. Coleman and K. S. McKinley, Tile Size Selection Using Cache Organization and Data Layout, ACM SIGPLAN Conf. Progr. Lang. Design and Implementation (PLDI), ACM Press (June 1995).","DOI":"10.1145\/207110.207162"},{"key":"301720_CR21","unstructured":"S. Carr and K. Kennedy, Compiler Blockability of Numerical Algorithms, Supercomputing (1992)."},{"key":"301720_CR22","unstructured":"S. Carr and R. B. Lehoucq, A Compiler-Blockable Algorithm for QR Decomposition (1994)."},{"key":"301720_CR23","unstructured":"R. Schreiber and J. Ramanujam, Personal communication (September 1997)."},{"issue":"4","key":"301720_CR24","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1145\/233561.233564","volume":"18","author":"K. S. McKinley","year":"1996","unstructured":"K. S. McKinley, S. Carr, and C.-W. Tseng, Improving Data Locality with Loop Transformations, ACM Trans. Progr. Lang. Syst., 18(4):424-453 (July 1996).","journal-title":"ACM Trans. Progr. Lang. Syst."},{"key":"301720_CR25","doi-asserted-by":"crossref","unstructured":"Y. Song and Z. Li, New Tiling Techniques to Improve Cache Locality, SIGPLAN99 Conf. Progr. Lang. Design Implementation (June 1999).","DOI":"10.1145\/301618.301668"},{"key":"301720_CR26","doi-asserted-by":"crossref","unstructured":"A. Rogers and K. Pingali, Process Decomposition Through Locality of Reference, SIGPLAN Conf. Progr. Lang. Design and Implementation (June 1989).","DOI":"10.1145\/73141.74824"},{"key":"301720_CR27","doi-asserted-by":"crossref","unstructured":"J. Anderson, S. Amarsinghe, and M. Lam, Data and Computation Transformations for Multiprocessors, ACM Symp. Principles and Practice of Parallel Programming (June 1995).","DOI":"10.1145\/209936.209954"},{"key":"301720_CR28","doi-asserted-by":"crossref","unstructured":"M. Cierniak and W. Li, Unifying Data and Control Transformations for Distributed Shared Memory Machines, SIGPLAN Conf. Progr. Lang. Design and Implementation (June 1995).","DOI":"10.1145\/207110.207145"},{"key":"301720_CR29","doi-asserted-by":"crossref","unstructured":"W. Pugh, Counting Solutions to Presburger Formulas: How and Why. Technical report, University of Maryland (1993).","DOI":"10.1145\/178243.178254"},{"key":"301720_CR30","doi-asserted-by":"crossref","unstructured":"P. Clauss, Counting Solutions to Linear and Nonlinear Constraints through Ehrhart Polynomials: Applications to Analyze and Transform Scientific Programs, ACM Int'l. Conf. Supercomputing (May 1996).","DOI":"10.1145\/237578.237617"},{"key":"301720_CR31","unstructured":"I. Kodukula, Data-centric Compilation, Ph.D. thesis, Cornell University (1998)."},{"key":"301720_CR32","unstructured":"N. Mateev, V. Menon, and K. Pingali, Fractal Symbolic Analysis for Program Transformations. To appear as a Cornell CS Technical Report."},{"key":"301720_CR33","doi-asserted-by":"crossref","unstructured":"W. Pugh and E. Rosser, Iteration Space Slicing for Locality,Proc. 12th Int'l. Workshop Lang. Compilers for Parallel Computing, (LCPC99) (August 1999).","DOI":"10.1007\/3-540-44905-1_11"},{"issue":"4","key":"301720_CR34","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1109\/TSE.1984.5010248","volume":"10","author":"M. Weiser","year":"1984","unstructured":"M. Weiser, Program Slicing, IEEE Trans. Software Engineering, 10(4):352-357 (1984).","journal-title":"IEEE Trans. Software Engineering"},{"key":"301720_CR35","doi-asserted-by":"crossref","unstructured":"V. Kotlyar, K. Pingali, and P. Stodghill, A Relational Approach to the Compilation of Sparse Matrix Programs, in EUROPAR (1997).","DOI":"10.1007\/BFb0002751"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011172104768.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011172104768\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011172104768.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:21:17Z","timestamp":1748334077000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011172104768"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["301720"],"URL":"https:\/\/doi.org\/10.1023\/a:1011172104768","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}