{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:34:42Z","timestamp":1648632882177},"reference-count":25,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":[[1990,12]]},"DOI":"10.1016\/0167-8191(90)90061-d","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"239-251","source":"Crossref","is-referenced-by-count":4,"title":["Expression for massively parallel algorithms \u2014 description and illustrative example"],"prefix":"10.1016","volume":"16","author":[{"given":"M.C","family":"Counilh","sequence":"first","affiliation":[]},{"given":"J","family":"Roman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(90)90061-D_BIB1","unstructured":"The programming language ADA reference manual, Vol. 106 of LNCS, Springer Verlag."},{"issue":"4","key":"10.1016\/0167-8191(90)90061-D_BIB2","first-page":"385","article-title":"Le placement de t\u00e2ches sur des architectures parall\u00e8les","volume":"7","author":"Andr\u00e9","year":"1988","journal-title":"Technique et Science Informatiques"},{"issue":"1","key":"10.1016\/0167-8191(90)90061-D_BIB3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/356901.356903","article-title":"Concepts and notations for concurrent programming","volume":"15","author":"Andrews","year":"1983","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0167-8191(90)90061-D_BIB4","article-title":"Transition systems and concurrent processes","author":"Arnold","year":"1987"},{"key":"10.1016\/0167-8191(90)90061-D_BIB5","unstructured":"P. Charrier and J. Roman, Study of the parallelism induced by a nested dissection method and of its implementation on a message passing multiprocessor computer, Rapport interne I-8722, Universit\u00e9 de Bordeaux I, submitted for publication in SIAM J. Comput."},{"issue":"2","key":"10.1016\/0167-8191(90)90061-D_BIB6","article-title":"Etude de la s\u00e9paration et de l'\u00e9limination sur une famille de graphes quotients d\u00e9duite d'une m\u00e9thode de dissections embo\u00eet\u00e9es","volume":"22","author":"Charrier","year":"1988","journal-title":"RAIRO Informatique th\u00e9orique et Applications"},{"key":"10.1016\/0167-8191(90)90061-D_BIB7","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01396049","article-title":"Algorithmique et calculs de complexit\u00e9 pour un solveur de type dissections embo\u00eet\u00e9es","volume":"55","author":"Charrier","year":"1989","journal-title":"Numer. Math."},{"key":"10.1016\/0167-8191(90)90061-D_BIB8","article-title":"Parallel implementation of block Cholesky method in the programming environment of the distributed memory multiprocessor CHEOPS","volume":"Vol. 2","author":"Charrier","year":"1989"},{"key":"10.1016\/0167-8191(90)90061-D_BIB9","series-title":"Fourth SIAM Conf. on Parallel Processing for Scientific Computing","article-title":"Partitioning and message-communicating process implementation of a nested dissection algorithm","author":"Charrier","year":"1989"},{"key":"10.1016\/0167-8191(90)90061-D_BIB10","article-title":"Etude et r\u00e9alisation d'un simulateur et de son environment pour le calculateur CHEOPS","author":"Chaumette","year":"1989"},{"key":"10.1016\/0167-8191(90)90061-D_BIB11","article-title":"LCH: un langage pour la programmation du calculateur CHEOPS","author":"Counill","year":"1989","journal-title":"Th\u00e8se de l'Universit\u00e9 de Bordeaux I"},{"key":"10.1016\/0167-8191(90)90061-D_BIB12","series-title":"CFIP'88, Ing\u00e9nieri des protocoles","article-title":"MEC: un outil de calcul sur les systm\u0300es de transitions","author":"Crubill\u00e9","year":"1988"},{"key":"10.1016\/0167-8191(90)90061-D_BIB13","series-title":"computer Solution of Large Sparse Positive Definite Systems","author":"George","year":"1981"},{"key":"10.1016\/0167-8191(90)90061-D_BIB14","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF01396660","article-title":"The analysis of a nested dissection algorithm","volume":"50","author":"Gilbert","year":"1987","journal-title":"Numer. Math."},{"issue":"8","key":"10.1016\/0167-8191(90)90061-D_BIB15","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/0167-8191(90)90061-D_BIB16","series-title":"Proc. First European Workshop on Hypercube and Distributed Computers","article-title":"S: The CHEOPS operating system","author":"L\u00e9pine","year":"1989"},{"key":"10.1016\/0167-8191(90)90061-D_BIB17","article-title":"A calculus of communicating systems","volume":"Vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/0167-8191(90)90061-D_BIB18","year":"1984"},{"issue":"56","key":"10.1016\/0167-8191(90)90061-D_BIB19","first-page":"116","article-title":"Mapp: un m\u00e9canisme d'aide au placement des processus sur multiprocesseur","author":"Pazat","year":"1987","journal-title":"Bigre + Globule"},{"key":"10.1016\/0167-8191(90)90061-D_BIB20","article-title":"Outils pour la programmation d'un multiprocesseur \u00e0 m\u00e9moires distribu\u00e9es","author":"Pazat","year":"1989","journal-title":"Th\u00e8se de l'Universit\u00e9 de Bordeaux I"},{"key":"10.1016\/0167-8191(90)90061-D_BIB21","series-title":"Proc. First European Workshop on Hypercube and Distributed Computers","article-title":"A control replay scheme for distributed systems","author":"Pazat","year":"1989"},{"key":"10.1016\/0167-8191(90)90061-D_BIB22","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01389708","article-title":"Calculs de complexit\u00e9 relatifs \u00e0 une m\u00e9thode de dissection embbo\u00eet\u00e9e","volume":"47","author":"Roman","year":"1985","journal-title":"Numer. Math."},{"key":"10.1016\/0167-8191(90)90061-D_BIB23","article-title":"Complexit\u00e9 d'algorithmes de s\u00e9paration de graphes pour des impl\u00e9mentations s\u00e9quentielles et r\u00e9parties de l'\u00e9limination de Gauss","author":"Roman","year":"1987"},{"key":"10.1016\/0167-8191(90)90061-D_BIB24","article-title":"Pr\u00e9entation du calculateur CHEOPS","author":"Roman","year":"1987","journal-title":"Journ\u00e9es Algorithmes et Architectures \u00e0 haut degr\u00e9 de parall\u00e9liisme"},{"key":"10.1016\/0167-8191(90)90061-D_BIB25","unstructured":"B. Vauquelin, S\u00e9mantique des communications pour un syst\u00e8me d'exploitation multiprocesseers, Rapport interne Universit\u00e9 de Bordeaux I, to appear."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090061D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090061D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T04:26:31Z","timestamp":1551068791000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919090061D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":25,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["016781919090061D"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90061-d","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}