{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:28:03Z","timestamp":1648924083506},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1016\/0743-7315(91)90027-7","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T20:14:09Z","timestamp":1077567249000},"page":"39-49","source":"Crossref","is-referenced-by-count":0,"title":["Compaction of message patterns into succinct representations for multiprocessor interconnection networks"],"prefix":"10.1016","volume":"12","author":[{"given":"P.J.","family":"Bernhard","sequence":"first","affiliation":[]},{"suffix":"III","given":"H.B.","family":"Hunt","sequence":"additional","affiliation":[]},{"given":"D.J.","family":"Rosenkrantz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(91)90027-7_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0743-7315(91)90027-7_BIB2_1","series-title":"Proc. 1988 Symposium on the Frontiers of Massively Parallel Computation","first-page":"115","article-title":"An efficient method for the representation and transmission of message patterns on multistage interconnection networks","author":"Bernhard","year":"1988"},{"key":"10.1016\/0743-7315(91)90027-7_BIB2_2","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/0743-7315(91)90072-H","volume":"11","author":"Bernhard","year":"1991","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0743-7315(91)90027-7_BIB3","unstructured":"Bernhard, P. J., and Rosenkrantz, D. J. Algebraic structure of mask-representable address sets and message patterns. Tech. Rep. TR89-32, Computer Science Department, State University of New York at Albany."},{"key":"10.1016\/0743-7315(91)90027-7_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"2","key":"10.1016\/0743-7315(91)90027-7_BIB5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1109\/12.2159","article-title":"Self-routing technique in perfect-shuffle networks using control tags","volume":"37","author":"Huang","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90027-7_BIB6_1","series-title":"Proc. 1988 Symposium on the Frontiers of Massively Parallel Computation","first-page":"479","article-title":"Routing linear permutations through the Omega network in two passes","author":"Keohane","year":"1988"},{"key":"10.1016\/0743-7315(91)90027-7_BIB6_2","series-title":"Tech. Rep.","author":"Keohane","year":"1988"},{"key":"10.1016\/0743-7315(91)90027-7_BIB7","first-page":"278","article-title":"A fault-tolerant routing algorithm for BPC permutations in parallel computers","volume":"Vol. I","author":"Nassimi","year":"1989"},{"issue":"1","key":"10.1016\/0743-7315(91)90027-7_BIB8","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/322169.322172","article-title":"An optimal routing algorithm for mesh-connected parallel computers","volume":"27","author":"Nassimi","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"issue":"5","key":"10.1016\/0743-7315(91)90027-7_BIB9","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1109\/TC.1981.1675791","article-title":"A self-routing Benes network and parallel permutation algorithms","volume":"C-30","author":"Nassimi","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0743-7315(91)90027-7_BIB10","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1109\/TC.1982.1676004","article-title":"Optimal BPC permutations on a cube connected SIMD computer","volume":"C-31","author":"Nassimi","year":"1982","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0743-7315(91)90027-7_BIB11","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TC.1986.1676763","article-title":"Fault-tolerant multiprocessors with redundant-path interconnection networks","volume":"C-35","author":"Raghavendra","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90027-7_BIB12","series-title":"Interconnection Networks for Large-Scale Parallel Processing","author":"Siegel","year":"1985"},{"key":"10.1016\/0743-7315(91)90027-7_BIB13","article-title":"Design and analysis of reliable interconnection networks","author":"Varma","year":"1986"},{"issue":"4","key":"10.1016\/0743-7315(91)90027-7_BIB14","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1109\/TC.1981.1675778","article-title":"An easily controlled network for frequently used permutations","volume":"C-30","author":"Yew","year":"1981","journal-title":"IEEE Trans. Comput."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731591900277?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731591900277?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T01:26:53Z","timestamp":1550194013000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731591900277"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["0743731591900277"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(91)90027-7","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}