{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:26:21Z","timestamp":1649075181877},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,8,1]],"date-time":"1984-08-01T00:00:00Z","timestamp":460166400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1984,8]]},"DOI":"10.1016\/0020-0190(84)90100-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"69-73","source":"Crossref","is-referenced-by-count":3,"title":["Communication problems on MIMD parallel computers"],"prefix":"10.1016","volume":"19","author":[{"given":"G.P.","family":"McKeown","sequence":"first","affiliation":[]},{"given":"V.J.","family":"Rayward-Smith","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(84)90100-5_BIB1","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/TC.1982.1675886","article-title":"A regular network for multicomputer systems","volume":"C-31","author":"Arden","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(84)90100-5_BIB2","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1145\/322063.322067","article-title":"Asynchronous iterative methods for multiprocessors","volume":"25","author":"Baudet","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(84)90100-5_BIB3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02591967","article-title":"Distributed asynchronous computation of fixed points","volume":"27","author":"Bertsekas","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/0020-0190(84)90100-5_BIB4","unstructured":"F.W. Burton, M.M. Huntbach, G.P. McKeown and V.J. Rayward-Smith, Parallelism in branch-and-bound algorithms, Submitted for publication."},{"key":"10.1016\/0020-0190(84)90100-5_BIB5","series-title":"Combinatorial Optimization III","first-page":"19","article-title":"Parallel processing and combinatorial optimization","author":"Burton","year":"1982"},{"key":"10.1016\/0020-0190(84)90100-5_BIB6","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1109\/TC.1981.1675735","article-title":"The lens interconnection strategy","volume":"C-30","author":"Finkel","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(84)90100-5_BIB7","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1145\/322374.322382","article-title":"An efficient general purpose parallel computer","volume":"30","author":"Galil","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(84)90100-5_BIB8","unstructured":"G.A.P. Kindervater and J.K. Lenstra, Parallel algorithms in combinatorial optimization: An annotated bibliography, Combinatorial Optimization, Annotated Bibliographies (Wiley, New York, to appear)."},{"key":"10.1016\/0020-0190(84)90100-5_BIB9","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/TC.1982.1675977","article-title":"Dense trivalent graphs for processor interconnection","volume":"C-31","author":"Leland","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(84)90100-5_BIB10","unstructured":"G.P. McKeown, A special purpose MIMD parallel processor, Submitted for publication."},{"key":"10.1016\/0020-0190(84)90100-5_BIB11","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1109\/TC.1977.1674863","article-title":"The indirect binary n-cube microprocessor array","volume":"C-26","author":"Pease","year":"1977","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(84)90100-5_BIB12","article-title":"Algorithm design and VLSI architectures","author":"Preparata","year":"1982","journal-title":"Proc. IBM Symposium on Parallel Processing"},{"key":"10.1016\/0020-0190(84)90100-5_BIB13","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","article-title":"The cube-connected-cycles: A versatile network for parallel computation","volume":"24","author":"Preparata","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(84)90100-5_BIB14","article-title":"Probabilistic algorithms on parallel computers","author":"Rayward-Smith","year":"1983","journal-title":"Proc. IEEE Melecon Conference"},{"key":"10.1016\/0020-0190(84)90100-5_BIB15","first-page":"263","article-title":"Universal schemes for parallel communication","author":"Valiant","year":"1981","journal-title":"Proc. 13th ACM Symp. on Theory of Computing"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084901005?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084901005?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:58:27Z","timestamp":1555088307000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019084901005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,8]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,8]]}},"alternative-id":["0020019084901005"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(84)90100-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1984,8]]}}}