{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:32:05Z","timestamp":1757626325586,"version":"3.44.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1016\/0167-9260(95)00018-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:27:58Z","timestamp":1027585678000},"page":"63-83","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Communication code generation in systems of affine recurrence equations"],"prefix":"10.1016","volume":"20","author":[{"given":"Christophe","family":"Reffay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy-Ren\u00e9","family":"Perrin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"20","key":"10.1016\/0167-9260(95)00018-6_BIB1","first-page":"214","article-title":"Non-unimodular transformations of nested loops","volume":"16","author":"Ramanujam","year":"1992","journal-title":"IEEE Comput. Soc. Press"},{"article-title":"A framework for unifying reordering transformations","year":"1993","author":"Kelly","key":"10.1016\/0167-9260(95)00018-6_BIB2"},{"key":"10.1016\/0167-9260(95)00018-6_BIB3","series-title":"7th SIAM Conf. on Parallel Processing for Scientific Computing","article-title":"The SUIF compiler for scalable parallel machines","author":"Amarasinghe","year":"1995"},{"key":"10.1016\/0167-9260(95)00018-6_BIB4","first-page":"119","article-title":"Overview of EPPP \u2014 an environment for portable parallel programming","author":"Hurteau","year":"1994"},{"key":"10.1016\/0167-9260(95)00018-6_BIB5","first-page":"46","article-title":"The tiny loop restructuring research tool","volume":"Vol. II","author":"Wolfe","year":"1991"},{"key":"10.1016\/0167-9260(95)00018-6_BIB6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01407931","article-title":"Analysis of array and scalar references","volume":"20","author":"Feautrier","year":"1991","journal-title":"J. Parallel Programming"},{"key":"10.1016\/0167-9260(95)00018-6_BIB7","series-title":"CONCUR 93","article-title":"Loop parallelization in the polytope model","author":"Lengauer","year":"1993"},{"key":"10.1016\/0167-9260(95)00018-6_BIB8","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"},{"article-title":"A systolizing compiler","year":"1992","author":"Barnett","key":"10.1016\/0167-9260(95)00018-6_BIB9_1"},{"key":"10.1016\/0167-9260(95)00018-6_BIB9_2","unstructured":"Report TR-92-13."},{"key":"10.1016\/0167-9260(95)00018-6_BIB10","series-title":"Languages and Compilers for Parallel Computing","article-title":"An overview of the Fortran D programming system","volume":"Vol. 589","author":"Hiranandani","year":"1992"},{"year":"1994","series-title":"High performance fortran language specification","key":"10.1016\/0167-9260(95)00018-6_BIB11"},{"key":"10.1016\/0167-9260(95)00018-6_BIB12","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01192158","article-title":"Geometrical tools to map systems of affine recurrence equations on regular arrays","volume":"31","author":"Mongenet","year":"1994","journal-title":"Acta Inform."},{"key":"10.1016\/0167-9260(95)00018-6_BIB13","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF01407835","article-title":"Some efficient solutions to the affine scheduling problem: Part I: one-dimensional time","volume":"21","author":"Featrier","year":"1992","journal-title":"Int. J. Parallel Programming"},{"key":"10.1016\/0167-9260(95)00018-6_BIB14","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF01379404","article-title":"Some efficient solutions to the affine scheduling problem: Part II: multidimensional time","volume":"21","author":"Feautrier","year":"1992","journal-title":"Int. J. Parallel Programming"},{"year":"1986","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","key":"10.1016\/0167-9260(95)00018-6_BIB15"},{"article-title":"R\u00e9solution de syst\u00e8mes d'in\u00e9quations lin\u00e9aires: mode d'emploi du logiciel PIP","year":"1989","author":"Feautrier","key":"10.1016\/0167-9260(95)00018-6_BIB16"},{"key":"10.1016\/0167-9260(95)00018-6_BIB17","first-page":"73","article-title":"La synth\u00e8se de nids de boucles avec la biblioth\u00e8que poly\u00e9drique","author":"Le Verge","year":"1994","journal-title":"RenPar'6"},{"article-title":"G\u00e9n\u00e9ration automatique de codes de transfert pour multiprocesseurs \u00e0 m\u00e9moires loc\u00e1les","year":"1991","author":"Ancourt","key":"10.1016\/0167-9260(95)00018-6_BIB18"},{"key":"10.1016\/0167-9260(95)00018-6_BIB19","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1142\/S0129626494000284","article-title":"Compiling distributed loops onto SPMD code","volume":"4","author":"Van Dongen","year":"1994","journal-title":"Parallel Processing Lett."},{"key":"10.1016\/0167-9260(95)00018-6_BIB20","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02477176","article-title":"The mapping of linear recurrence equations on regular arrays","volume":"1","author":"Quinton","year":"1989","journal-title":"J. VLSI Signal Processing"},{"article-title":"Synth\u00e8se d'algorithmes systoliques et implantation optimale en place sur r\u00e9seaux de processeurs synchrones","year":"1990","author":"Clauss","key":"10.1016\/0167-9260(95)00018-6_BIB21"},{"key":"10.1016\/0167-9260(95)00018-6_BIB22","first-page":"14","article-title":"Nested loop sequences: towards efficient loop structures in automatic parallelization","author":"Chamski","year":"1994"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926095000186?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926095000186?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:36:36Z","timestamp":1757453796000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167926095000186"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["0167926095000186"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(95)00018-6","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1995,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Communication code generation in systems of affine recurrence equations","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(95)00018-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}