{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T07:12:15Z","timestamp":1766733135442,"version":"3.44.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,10,1]],"date-time":"1991-10-01T00:00:00Z","timestamp":686275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,10,1]],"date-time":"1991-10-01T00:00:00Z","timestamp":686275200000},"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,10]]},"DOI":"10.1016\/0743-7315(91)90094-p","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"246-255","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":18,"title":["Optimal broadcasting on SIMD hypercubes without indirect addressing capability"],"prefix":"10.1016","volume":"13","author":[{"given":"Ching-Tien","family":"Ho","sequence":"first","affiliation":[]}],"member":"78","reference":[{"year":"1974","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/0743-7315(91)90094-P_BIB1"},{"article-title":"The tree machine: A highly concurrent computing environment","year":"1980","author":"Browning","key":"10.1016\/0743-7315(91)90094-P_BIB2"},{"key":"10.1016\/0743-7315(91)90094-P_BIB3","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0743-7315(87)90038-4","article-title":"Gaussian elimination on a hypercube automaton","volume":"4","author":"Cappello","year":"1987","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0743-7315(91)90094-P_BIB4","series-title":"Complexity of Computer Computations","first-page":"153","article-title":"Efficiency of equivalence algorithms","author":"Fischer","year":"1972"},{"article-title":"Concurrent processor load balancing as a statistical physics problem","year":"1985","author":"Fox","key":"10.1016\/0743-7315(91)90094-P_BIB5"},{"issue":"12","key":"10.1016\/0743-7315(91)90094-P_BIB6","doi-asserted-by":"crossref","first-page":"1180","DOI":"10.1109\/TC.1984.1676393","article-title":"On the impact of communication complexity in the design of parallel numerical algorithms","volume":"33","author":"Gannon","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90094-P_BIB7","series-title":"Hypercube Multiprocessors 1986","first-page":"161","article-title":"Matrix factorization on a hypercube multiprocessor","author":"Geist","year":"1987"},{"key":"10.1016\/0743-7315(91)90094-P_BIB8","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1145\/7902.7903","article-title":"Data parallel algorithms","volume":"29","author":"Hillis","year":"1986","journal-title":"Comm. ACM"},{"article-title":"Optimal communication primitives and graph embeddings on hypercubes","year":"1990","author":"Ho","key":"10.1016\/0743-7315(91)90094-P_BIB9"},{"key":"10.1016\/0743-7315(91)90094-P_BIB10","series-title":"Proc. 1986 International Conference on Parallel Processing","first-page":"640","article-title":"Distributed routing algorithms for broadcasting and personalized communication in hypercubes","author":"Ho","year":"1986"},{"key":"10.1016\/0743-7315(91)90094-P_BIB11","series-title":"Proc. 1988 International Conference on Parallel Processing","first-page":"112","article-title":"Solving linear programming on fixed-size hypercubes","author":"Ho","year":"1988"},{"issue":"2","key":"10.1016\/0743-7315(91)90094-P_BIB12","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":"Odd-even cyclic reduction on ensemble architectures and the solution of tridiagonal systems of equations","year":"1984","author":"Johnsson","key":"10.1016\/0743-7315(91)90094-P_BIB13"},{"article-title":"Algorithms for multiplying matrices of arbitrary shapes using shared memory primitives on a Boolean cube","year":"1987","author":"Johnsson","key":"10.1016\/0743-7315(91)90094-P_BIB14"},{"issue":"9","key":"10.1016\/0743-7315(91)90094-P_BIB15","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","article-title":"Spanning graphs for optimum broadcasting and personalized communication in hypercubes","volume":"38","author":"Johnsson","year":"1989","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/0743-7315(91)90094-P_BIB16","doi-asserted-by":"crossref","first-page":"s227","DOI":"10.1137\/0908023","article-title":"Hypercube algorithms and implementations","volume":"8","author":"McBryan","year":"1987","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0743-7315(91)90094-P_BIB17","series-title":"Hypercube Multiprocessors 1986","first-page":"181","article-title":"Matrix computation on distributed memory multiprocessors","author":"Moler","year":"1987"},{"article-title":"Data communication in hypercubes","year":"1985","author":"Saad","key":"10.1016\/0743-7315(91)90094-P_BIB18"},{"article-title":"Topological properties of hypercubes","year":"1985","author":"Saad","key":"10.1016\/0743-7315(91)90094-P_BIB19"},{"key":"10.1016\/0743-7315(91)90094-P_BIB20","series-title":"Proc. Fourth Annual Symposium on Computer Architecture","first-page":"105","article-title":"A large scale homogeneous, fully distributed parallel machine","author":"Sullivan","year":"1977"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190094P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190094P?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:29:17Z","timestamp":1757514557000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159190094P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["074373159190094P"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(91)90094-p","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1991,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal broadcasting on SIMD hypercubes without indirect addressing capability","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)90094-P","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"}]}}