{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:29:28Z","timestamp":1748334568648},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1995,9]]},"abstract":"<jats:p> Most parallelization techniques for [Formula: see text] loop nests are based on reindexation. Reindexation yields a new iteration space, which is a convex integer polyhedron defined by a set of affine constraints. Parallel code generation thus needs to scan all the integer points of this convex, thereby requiring the construction of a new [Formula: see text] loop nest. We detail an algorithm to this purpose, which relies on a parametrized version of the Dual Simplex. We show how the resulting loop nest and especially the loop bounds can be kept simple, thus reducing the control overhead of parallelization to a minimum. <\/jats:p>","DOI":"10.1142\/s0129626495000394","type":"journal-article","created":{"date-parts":[[2004,11,10]],"date-time":"2004-11-10T11:14:37Z","timestamp":1100085277000},"page":"421-436","source":"Crossref","is-referenced-by-count":19,"title":["CONSTRUCTION OF DO LOOPS FROM SYSTEMS OF AFFINE CONSTRAINTS"],"prefix":"10.1142","volume":"05","author":[{"given":"JEAN-FRAN\u00c7OIS","family":"COLLARD","sequence":"first","affiliation":[{"name":"LIP, URA CNRS 1398, ENS Lyon, 46 All\u00e9e d'Italie F-69364 Lyon Cedex 07, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TANGUY","family":"RISSET","sequence":"additional","affiliation":[{"name":"LIP, URA CNRS 1398, ENS Lyon, 46 All\u00e9e d'Italie F-69364 Lyon Cedex 07, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PAUL","family":"FEAUTRIER","sequence":"additional","affiliation":[{"name":"PRiSM Laboratory, Universit\u00e9 de Versailles, 45 Avenue des Etats-Unis, F-78035 Versailles Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626495000394","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:18:08Z","timestamp":1565108288000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626495000394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":0,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1995,9]]}},"alternative-id":["10.1142\/S0129626495000394"],"URL":"https:\/\/doi.org\/10.1142\/s0129626495000394","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}