{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:13:09Z","timestamp":1742379189594},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1994,12]]},"abstract":"<jats:p> The performance of parallel architectures are limited at least as much by data transfer ability as by computing power. The main limit concerns the transfers on the interconnection network. But it becomes apparent that a majority of these communications can be known at compile time. The static model intends to exploit this a priori knowledge in order to drastically reduce the overhead of message passing, the ultimate goal being to confine the oommunication delays to the hardware propagation delays. In the paper, we present an abstract machine which is the target of a static-oriented compilation. We show how to recognize and sequence the static communication patterns, and we discuss the application scope of the model. <\/jats:p>","DOI":"10.1142\/s0129626494000338","type":"journal-article","created":{"date-parts":[[2004,11,19]],"date-time":"2004-11-19T02:21:13Z","timestamp":1100830873000},"page":"367-378","source":"Crossref","is-referenced-by-count":1,"title":["A STATIC EXECUTION MODEL FOR DATA PARALLELISM"],"prefix":"10.1142","volume":"04","author":[{"given":"C.","family":"GERMAIN","sequence":"first","affiliation":[{"name":"Laboratorie de Recherche en Informatique, CNRS URA 410 Universit\u00e9 Paris-Sud, F-91405 Orsay, Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"DELAPLACE","sequence":"additional","affiliation":[{"name":"Laboratoire de Recherche en Informatique, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"CARLIER","sequence":"additional","affiliation":[{"name":"Laboratorie de Recherche en Informatique, 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\/S0129626494000338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:31:39Z","timestamp":1565184699000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626494000338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":0,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1994,12]]}},"alternative-id":["10.1142\/S0129626494000338"],"URL":"https:\/\/doi.org\/10.1142\/s0129626494000338","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}