{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T08:25:57Z","timestamp":1648715157961},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5617,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0304-3975(97)00189-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"225-237","source":"Crossref","is-referenced-by-count":0,"title":["On XRAM and PRAM models, and on data-movement-intensive problems"],"prefix":"10.1016","volume":"194","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00189-8_BIB1","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(92)90271-G","article-title":"Data-movement-intensive problems: two folk theorems in parallel computation revisited","volume":"95","author":"Akl","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00189-8_BIB2","series-title":"5th SIAM Conf. on Parallel Processing for Scientific Computing","article-title":"LAPACK for distributed memory architecture","author":"Anderson","year":"1991"},{"key":"10.1016\/S0304-3975(97)00189-8_BIB3","series-title":"Parallel Computing '89","first-page":"3","article-title":"Designing parallel non numerical algorithms","author":"Cosnard","year":"1991"},{"key":"10.1016\/S0304-3975(97)00189-8_BIB4","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1109\/71.285609","article-title":"Analysis of aynchronous polynomial root finding methods on a distributed memory multicomputer","volume":"5","author":"Cosnard","year":"1994","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"key":"10.1016\/S0304-3975(97)00189-8_BIB5","series-title":"NATO Advanced Research Workshop \u2014 Software for Parallel Computation (Cetraro)","article-title":"A framework for data migrations on the hypercube","author":"Cosnard","year":"1992"},{"key":"10.1016\/S0304-3975(97)00189-8_BIB6","series-title":"4th ACM Conf. on Principles and Practice of Parallel Programming","article-title":"LogP: toward a realistic model of parallel computation","author":"Culler","year":"1993"},{"key":"10.1016\/S0304-3975(97)00189-8_BIB7","series-title":"Twenty second annual ACM Symp. on Theory of Computing","first-page":"193","article-title":"Deterministic sorting in nearly logarithmic time on the hypercube and related computers","author":"Cypher","year":"1990"},{"issue":"2","key":"10.1016\/S0304-3975(97)00189-8_BIB8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1142\/S012962649500014X","article-title":"Performance study of LU factorization with low communication overhead on multiprocessors","volume":"5","author":"Desprez","year":"1995","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0304-3975(97)00189-8_BIB9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","article-title":"Methods and problems of communication in usual networks","volume":"53","author":"Fraigniaud","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(97)00189-8_BIB10","series-title":"Efficient Parallel Algorithms","author":"Gibbons","year":"1988"},{"key":"10.1016\/S0304-3975(97)00189-8_BIB11","series-title":"Introduction to Automata, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(97)00189-8_BIB12","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton","year":"1992"},{"key":"10.1016\/S0304-3975(97)00189-8_BIB13","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-61626-8_20","article-title":"Efficient block cyclic data redistribution","author":"Prylli","year":"1996"},{"issue":"8","key":"10.1016\/S0304-3975(97)00189-8_BIB14","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","article-title":"A bridging model for parallel computation","volume":"38","author":"Valiant","year":"1990","journal-title":"Comm. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001898?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001898?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:50:08Z","timestamp":1555375808000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597001898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0304397597001898"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00189-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}