{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:49:03Z","timestamp":1761292143305,"version":"3.44.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1016\/0743-7315(91)90033-6","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"263-275","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":99,"title":["Optimal communication algorithms for hypercubes"],"prefix":"10.1016","volume":"11","author":[{"given":"D.P.","family":"Bertsekas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"\u00d6zveren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.D.","family":"Stamoulis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Tseng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.N.","family":"Tsitsiklis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1989","series-title":"Parallel and Distributed Computation: Numerical Methods","author":"Bertsekas","key":"10.1016\/0743-7315(91)90033-6_BIB1"},{"article-title":"How to embed trees in hypercubes","year":"1985","author":"Bhatt","key":"10.1016\/0743-7315(91)90033-6_BIB2"},{"key":"10.1016\/0743-7315(91)90033-6_BIB3","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TC.1987.1676939","article-title":"Deadlock-free message routing in multiprocessor interconnection networks","volume":"C-36","author":"Dally","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90033-6_BIB4","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0210049","article-title":"Parallel matrix and graph algorithms","volume":"10","author":"Dekel","year":"1981","journal-title":"SIAM J. Comput."},{"year":"1989","series-title":"Deflection routing in hypercube networks","author":"Greenberg","key":"10.1016\/0743-7315(91)90033-6_BIB5"},{"key":"10.1016\/0743-7315(91)90033-6_BIB6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/0743-7315(91)90033-6_BIB7","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","article-title":"Optimum broadcasting and personalized communication in hypercubes","volume":"38","author":"Johnsson","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90033-6_BIB8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0010-4655(85)90153-5","article-title":"Cyclic reduction on a binary tree","volume":"37","author":"Johnsson","year":"1985","journal-title":"Comput. Phys. Comm."},{"key":"10.1016\/0743-7315(91)90033-6_BIB9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0743-7315(87)90002-5","article-title":"Communication efficient basic linear algebra computations on hypercube architectures","volume":"4","author":"Johnsson","year":"1987","journal-title":"J. Parallel Distrib. Comput."},{"article-title":"The token exchange problem","year":"1988","author":"Krumme","key":"10.1016\/0743-7315(91)90033-6_BIB10"},{"key":"10.1016\/0743-7315(91)90033-6_BIB11","first-page":"267","article-title":"Virtual cut-through: A new computer communicating switching technique","volume":"3","author":"Kermani","year":"1979","journal-title":"Comput. Networks"},{"key":"10.1016\/0743-7315(91)90033-6_BIB12","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/0908023","article-title":"Hypercube algorithms and their implementations","volume":"8","author":"McBryan","year":"1987","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"10.1016\/0743-7315(91)90033-6_BIB13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/35.35508","article-title":"Broadband ISDN and asynchronous transfer mode (ATM)","author":"Minzer","year":"1989","journal-title":"IEEE Comm. Mag."},{"article-title":"Communication aspects of parallel processing","year":"1987","author":"Ozveren","key":"10.1016\/0743-7315(91)90033-6_BIB14"},{"article-title":"Data communication in hypercubes","year":"1985","author":"Saad","key":"10.1016\/0743-7315(91)90033-6_BIB15"},{"key":"10.1016\/0743-7315(91)90033-6_BIB16","article-title":"Data communication in parallel architectures","author":"Saad","year":"1986","journal-title":"Yale University Report"},{"key":"10.1016\/0743-7315(91)90033-6_BIB17","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/0024-3795(87)90128-5","article-title":"Parallel direct methods for solving banded linear systems","volume":"88\/89","author":"Saad","year":"1987","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0743-7315(91)90033-6_BIB18","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","article-title":"Topological properties of hypercubes","volume":"37","author":"Saad","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90033-6_BIB19","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0024-3795(86)90174-6","article-title":"Communication complexity of the Gaussian elimination algorithm on multiprocessors","volume":"77","author":"Saad","year":"1986","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0743-7315(91)90033-6_BIB20","series-title":"Proc. 29th IEEE Conf Decision and Control","first-page":"1349","article-title":"Efficient routing schemes for multiple broadcasts in hypercubes","author":"Stamoulis","year":"1990"},{"key":"10.1016\/0743-7315(91)90033-6_BIB21","series-title":"Proc. 1986 Hypercube Conference","first-page":"251","article-title":"Passing messages in link-bound hypercubes","author":"Stout","year":"1987"},{"key":"10.1016\/0743-7315(91)90033-6_BIB22","first-page":"207","article-title":"Concurrent broadcast for information dissemination","volume":"13","author":"Topkis","year":"1983","journal-title":"IEEE Trans. Software Engrg."},{"article-title":"Communication algorithms for isotropic tasks in hypercubes and wraparound meshes","year":"1990","author":"Varvarigos","key":"10.1016\/0743-7315(91)90033-6_BIB23"},{"article-title":"Optimal communication algorithms for multiprocessor computers","year":"1990","author":"Varvarigos","key":"10.1016\/0743-7315(91)90033-6_BIB24"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731591900336?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731591900336?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:28:04Z","timestamp":1757514484000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731591900336"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["0743731591900336"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(91)90033-6","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1991,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal communication algorithms for hypercubes","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(91)90033-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}