{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:22:36Z","timestamp":1755220956006,"version":"3.43.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"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":[[2001,8]]},"DOI":"10.1023\/a:1011144404437","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T03:43:03Z","timestamp":1040614983000},"page":"67-83","source":"Crossref","is-referenced-by-count":5,"title":["Communication-Free Alignment for Array References with Linear Subscripts in Three Loop Index Variables or Quadratic Subscripts"],"prefix":"10.1007","volume":"20","author":[{"given":"Weng-Long","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chih-Ping","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Hwa","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"350766_CR1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"71","author":"J. Edmonds","year":"1967","unstructured":"Jack Edmonds. Systems of distinct representative and linear algebra, Journal of Research of National Bureau of Standards, Sect. B, 71(4):241-245, 1967.","journal-title":"Journal of Research of National Bureau of Standards"},{"key":"350766_CR2","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1016\/S0167-8191(05)80036-5","volume":"17","author":"J. Dongarra","year":"1991","unstructured":"J. Dongarra, M. Furtney, S. Reinhardt, and J. Russell. Parallel loops-a test suite for parallelizing compilers: Description andexample results, Parallel Computing 17:1247-1255, 1991.","journal-title":"Parallel Computing"},{"key":"350766_CR3","doi-asserted-by":"crossref","first-page":"1223","DOI":"10.1016\/S0167-8191(05)80035-3","volume":"17","author":"D. Levine","year":"1991","unstructured":"David Levine, David Callahan, and Jack Dongarra. A comparative study of automatic vectorizing compilers, Parallel Computing 17:1223-1244, 1991.","journal-title":"Parallel Computing"},{"key":"350766_CR4","doi-asserted-by":"crossref","unstructured":"David Bau, Induprakas Kodukula, Vladimir Kotlyar, Keshav Pingali, and Paul Stodghill. Solving alignment using elementary linear algebra. In: Conference Record of the 7th Workshop on Languages and Compilers for Parallel Computing, pp. 46-60, August 1994.","DOI":"10.1007\/BFb0025870"},{"key":"350766_CR5","volume-title":"High Performance Compilers for Parallel Computing","author":"M. Wolfe","year":"1996","unstructured":"Michael Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley Publishing Company, Redwood City, 1996."},{"key":"350766_CR6","volume-title":"Computer Architecture: A Quantitative Approach","author":"J. L. Hennessy","year":"1996","unstructured":"John L. Hennessy and David A. Patterson. Computer Architecture: A Quantitative Approach, Second Edition. Morgan Kaufmann Publishers, Inc. San Francisco, California, 1996.","edition":"Second Edition"},{"key":"350766_CR7","unstructured":"Chih-Ping Chu, Weng-Long Chang, Iwen Chen, and Peng-Sheng Chen. Communication-free alignment for array references with linear subscripts in two loop index variables or quadratic subscripts. Proceedings of the Second IASTED International Conference on Parallel and Distributed Computing and Networks (PDCN'98), Australia, pp. 571-576."},{"key":"350766_CR8","doi-asserted-by":"crossref","unstructured":"M. Kandemir, A. Choudhary, N. Shenoy, P. Banerjee, and J. Ramanujam. A hyper-plane based approach for optimizing spatial locality in loop nests. In Proc.12th ACM Int. Conf. Supercomputing, July 1998.","DOI":"10.1145\/277830.277849"},{"key":"350766_CR9","doi-asserted-by":"crossref","unstructured":"M. Kandemir, J. Ramanujam, A. Choudhary, and P. Banerjee. A loop transformation algorithm based on explicit dada layout representation for optimizing locality. In Proc.11th International Workshop, LCPC'98, Chapel Hill, NC, USA, August 1998.","DOI":"10.1007\/3-540-48319-5_3"},{"issue":"3\u20134","key":"350766_CR10","first-page":"445","volume":"24","author":"A. W. Lam","year":"1998","unstructured":"A. W. Lam and M. S. Lam. Maximizing parallelism andminimizing synchronization with affine partitions. Parallel Computing, 24(3\u20134):445-475, 1998.","journal-title":"Parallel Computing"},{"issue":"9","key":"350766_CR11","first-page":"648","volume":"5","author":"V. Boudet","year":"1998","unstructured":"V. Boudet, F. Rastello, and Y. Robert. Alignment and distribution is NOT (always) NP-hard. Proceeding of 1998 International Conference on Parallel and Distributed Systems, 5(9):648-657, 1998.","journal-title":"Alignment and distribution is NOT (always) NP-hard"},{"issue":"12","key":"350766_CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1109\/71.752779","volume":"21","author":"M. Kandemir","year":"1999","unstructured":"M. Kandemir, A. Choudhary, N. Shenoy, P. Banerjee, and J. Ramanujam. A linear algebra framework for automatic determination of optimal data layouts. IEEE Transactions on Parallel and Distributed Systems, 21(12):115-135, 1999.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"350766_CR13","doi-asserted-by":"crossref","unstructured":"A. W. Lam, G. I. Cheong, and M. S. Lam. An affine partitioning algorithm to maximize parallelism and minimize communication. 13th ACM International Conference on Supercomputing, Rhodes, Greece, pp. 228-237, June 1999.","DOI":"10.1145\/305138.305197"},{"issue":"3","key":"350766_CR14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1023\/A:1008112110494","volume":"15","author":"K.-P. Shih","year":"2000","unstructured":"K.-P. Shih, J.-P. Sheu, and C.-H. Huang. Statement-level communication-free partitioning techniques for parallelizing compilers. The Journal of Supercomputing, 15(3):243-269, 2000.","journal-title":"The Journal of Supercomputing"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011144404437.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011144404437\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011144404437.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:27:52Z","timestamp":1754630872000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011144404437"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["350766"],"URL":"https:\/\/doi.org\/10.1023\/a:1011144404437","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}