{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:10:27Z","timestamp":1773796227679,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1996,12]]},"DOI":"10.1016\/s0167-8191(96)00049-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:16:06Z","timestamp":1027613766000},"page":"1373-1397","source":"Crossref","is-referenced-by-count":19,"title":["Mapping affine loop nests"],"prefix":"10.1016","volume":"22","author":[{"given":"Mich\u00e8le","family":"Dion","sequence":"first","affiliation":[]},{"given":"Yves","family":"Robert","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S0167-8191(96)00049-X_BIB1","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1145\/173262.155101","article-title":"Global optimizations for parallelism and locality on scalable parallel machines","volume":"28","author":"Andersen","year":"1993","journal-title":"ACM Sigplan Notices"},{"key":"10.1016\/S0167-8191(96)00049-X_BIB2_1","series-title":"Parallel Processing: CONPAR 94-VAPP VI","first-page":"713","article-title":"Evaluating array expressions on massively parallel machines with communication\/computation overlap","volume":"Vol. 854","author":"Bouchitt\u00e9","year":"1994"},{"key":"10.1016\/S0167-8191(96)00049-X_BIB2_2","unstructured":"extended version available as TR94-10, LIP, ENS Lyon."},{"key":"10.1016\/S0167-8191(96)00049-X_BIB3","first-page":"273","article-title":"Communication-free data allocation techniques for parallelizing compilers on multicomputers","volume":"Vol. 2","author":"Chen","year":"1993"},{"issue":"9","key":"10.1016\/S0167-8191(96)00049-X_BIB4","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1109\/71.308531","article-title":"Communication-free data allocation techniques for parallelizing compilers on multicomputers","volume":"5","author":"Chen","year":"1994","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"key":"10.1016\/S0167-8191(96)00049-X_BIB5","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1016\/0167-8191(94)90001-9","article-title":"Mapping uniform loop nests onto distributed memory architectures","volume":"20","author":"Darte","year":"1994","journal-title":"Parallel Computing"},{"issue":"3","key":"10.1016\/S0167-8191(96)00049-X_BIB6","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1142\/S0129626494000259","article-title":"On the alignment problem","volume":"4","author":"Darte","year":"1994","journal-title":"Parallel Processing Letters"},{"key":"10.1016\/S0167-8191(96)00049-X_BIB7","author":"Evans","year":"1992"},{"issue":"3","key":"10.1016\/S0167-8191(96)00049-X_BIB8","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1142\/S0129626494000235","article-title":"Towards automatic distribution","volume":"4","author":"Feautrier","year":"1994","journal-title":"Parallel Processing Lett."},{"key":"10.1016\/S0167-8191(96)00049-X_BIB9","author":"Garey","year":"1991"},{"issue":"1","key":"10.1016\/S0167-8191(96)00049-X_BIB10","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/0743-7315(91)90109-M","article-title":"Optimal expression evaluation for data parallel architectures","volume":"13","author":"Gilbert","year":"1991","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0167-8191(96)00049-X_BIB11","first-page":"251","article-title":"A model for automatic data partitioning","volume":"Vol. 2","author":"Hovland","year":"1993"},{"key":"10.1016\/S0167-8191(96)00049-X_BIB12","series-title":"Languages and Compilers for Parallel Computing","first-page":"186","article-title":"Communication-free hyperplane partitioning of nested loops","volume":"vol. 589","author":"Huang","year":"1991"},{"key":"10.1016\/S0167-8191(96)00049-X_BIB13","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/0743-7315(90)90086-5","article-title":"Data optimization: Allocation of arrays to reduce communication on SIMD machines","volume":"8","author":"Knobe","year":"1990","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0167-8191(96)00049-X_BIB14","author":"Korganoff","year":"1966"},{"key":"10.1016\/S0167-8191(96)00049-X_BIB15","article-title":"NP-completeness of dynamic remapping","author":"Kremer","year":"1993"},{"issue":"2","key":"10.1016\/S0167-8191(96)00049-X_BIB16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/360827.360844","article-title":"The parallel execution of DO loops","volume":"17","author":"Lamport","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/S0167-8191(96)00049-X_BIB17","series-title":"Frontiers 90: 3rd Symp. on the Frontiers of Massively Parallel Computation","article-title":"Index domain alignment: Minimizing cost of cross-referencing between distributed arrays","author":"Li","year":"1990"},{"key":"10.1016\/S0167-8191(96)00049-X_BIB18","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0743-7315(91)90090-V","article-title":"The data alignment phase in compiling programs for distributed memory machines","volume":"13","author":"Li","year":"1991","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0167-8191(96)00049-X_BIB19","first-page":"836","article-title":"Data locality for shared memory","volume":"Vol. 2","author":"Lukas","year":"1993"},{"key":"10.1016\/S0167-8191(96)00049-X_BIB20","series-title":"Proc. 5th SIAM Conf. on Parallel Processing for Scientific Computing","first-page":"478","article-title":"Data optimization and its effect on communication costs in MIMD fortran code","author":"Lukas","year":"1992"},{"key":"10.1016\/S0167-8191(96)00049-X_BIB21","author":"Mace","year":"1987"},{"key":"10.1016\/S0167-8191(96)00049-X_BIB22","series-title":"Proc. Scalable High-performance Computing Conf. SHPCC-92","first-page":"366","article-title":"Data alignment: Transformations to reduce communications on distributed memory architectures","author":"O'Boyle","year":"1992"},{"key":"10.1016\/S0167-8191(96)00049-X_BIB23","series-title":"Application Specific Array Processors","first-page":"439","article-title":"Data alignment of loop nests without nonlocal communications","author":"Shang","year":"1994"},{"key":"10.1016\/S0167-8191(96)00049-X_BIB24","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1006\/jpdc.1994.1042","article-title":"Data and task alignment in distributed memory architectures","volume":"21","author":"Sinharoy","year":"1994","journal-title":"J. Parallel Distributed Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781919600049X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781919600049X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T06:55:55Z","timestamp":1556261755000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016781919600049X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":25,"journal-issue":{"issue":"10","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["S016781919600049X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(96)00049-x","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}