{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:10:49Z","timestamp":1649027449950},"reference-count":10,"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":[[2003,9]]},"abstract":"<jats:p> We introduce a very simple, yet powerful, distribution calculus aimed at describing different strategies that can be used to distribute (ie, partition and replicate) multidimensional dense arrays over a set of processors, like what is done in the implementation of the P3L Map skeleton. We give a formal semantics, that allows to prove equations between distributions, and we show how to associate a cost to such distributions, allowing to choose between semantically equivalent distribution strategies. <\/jats:p>","DOI":"10.1142\/s0129626403001355","type":"journal-article","created":{"date-parts":[[2003,11,28]],"date-time":"2003-11-28T04:21:41Z","timestamp":1069993301000},"page":"377-388","source":"Crossref","is-referenced-by-count":1,"title":["A CALCULUS FOR DENSE ARRAY DISTRIBUTIONS"],"prefix":"10.1142","volume":"13","author":[{"given":"ROBERTO","family":"DI COSMO","sequence":"first","affiliation":[{"name":"Laboratory \"Preuves, Programmes et Syst\u00e9mes\",  University of Paris VII, 175, rue du Chevaleret, F-75013 Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SUSANNA","family":"PELAGATTI","sequence":"additional","affiliation":[{"name":"Dipartimento di Informatica, University of Pisa, Via F. Buonarroti, 2 I-56127 Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1080\/01495730108935268"},{"key":"rf2","first-page":"354","volume":"26","author":"Bacon D. F.","journal-title":"ACM Computing Surveys"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74884-4_5"},{"key":"rf4","first-page":"255","author":"Chen M.","journal-title":"Parallel Functional Languages and Compilers"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61736-1_44"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1437"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626402000951"},{"key":"rf10","volume-title":"Handbook of theoretical computer science","author":"Mosses P. D.","year":"1991"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1096-9128(199612)8:10<799::AID-CPE274>3.0.CO;2-7"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1155\/1997\/532130"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626403001355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:14:55Z","timestamp":1565093695000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626403001355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":10,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2003,9]]}},"alternative-id":["10.1142\/S0129626403001355"],"URL":"https:\/\/doi.org\/10.1142\/s0129626403001355","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}