{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:25:25Z","timestamp":1757629525439,"version":"3.44.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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,1]]},"DOI":"10.1016\/0743-7315(91)90072-h","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"72-85","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["An efficient method for representing and transmitting message patterns on multiprocessor interconnection networks"],"prefix":"10.1016","volume":"11","author":[{"given":"P.J.","family":"Bernhard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.J.","family":"Rosenkrantz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"7","key":"10.1016\/0743-7315(91)90072-H_BIB1","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1109\/TC.1983.1676295","article-title":"Graph theoretical analysis and design of multistate interconnection networks","volume":"C-32","author":"Agrawal","year":"1983","journal-title":"IEEE Trans. Comput."},{"year":"1990","series-title":"Algebraic structure of mask representable address sets and message patterns","author":"Bernhard","key":"10.1016\/0743-7315(91)90072-H_BIB2"},{"key":"10.1016\/0743-7315(91)90072-H_BIB3","first-page":"111","article-title":"Compaction of message patterns into space-efficient representations for multiprocessor interconnection networks","volume":"Vol. I","author":"Bernhard","year":"1989"},{"key":"10.1016\/0743-7315(91)90072-H_BIB4_1","series-title":"Proc. Twenty-Fifth Annual Allerton Conference on Communication, Control and Computing","article-title":"The complexity of routing through an omega network","author":"Bernhard","year":"1987"},{"year":"1987","author":"Bernhard","key":"10.1016\/0743-7315(91)90072-H_BIB4_2"},{"key":"10.1016\/0743-7315(91)90072-H_BIB5","series-title":"Proc. 1988 International Conference on Parallel Processing","first-page":"475","article-title":"A heuristic algorithm for conflict resolution problem in multistage interconnection networks","author":"Deogun","year":"1988"},{"key":"10.1016\/0743-7315(91)90072-H_BIB6","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"article-title":"Mathematical theory of multistage interconnection networks analysis","year":"1984","author":"Fang","key":"10.1016\/0743-7315(91)90072-H_BIB7"},{"year":"1979","series-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"Garey","key":"10.1016\/0743-7315(91)90072-H_BIB8"},{"key":"10.1016\/0743-7315(91)90072-H_BIB9","unstructured":"Hardy, R. M. Personal communication."},{"issue":"2","key":"10.1016\/0743-7315(91)90072-H_BIB10","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)90072-H_BIB11","series-title":"Proc. 29th Annual Symposium on Foundations of Computer Science","first-page":"221","article-title":"Increasing the size of a network by a constant factor can increase performance by more than a constant factor","author":"Koch","year":"1988"},{"key":"10.1016\/0743-7315(91)90072-H_BIB12","series-title":"Proc. 1988 Symposium on the Frontiers of Massively Parallel Computation","article-title":"Routing linear permutations through the omega network in two passes","author":"Keohane","year":"1988"},{"issue":"12","key":"10.1016\/0743-7315(91)90072-H_BIB13","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1109\/T-C.1975.224157","article-title":"Access and alignment of data in an array processor","volume":"C-21","author":"Lawrie","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90072-H_BIB14","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)90072-H_BIB15","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)90072-H_BIB16","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":"V-30","author":"Nassimi","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0743-7315(91)90072-H_BIB17","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."},{"article-title":"Communication issues in parallel computation","year":"1986","author":"Newman-Wolfe","key":"10.1016\/0743-7315(91)90072-H_BIB18"},{"issue":"4","key":"10.1016\/0743-7315(91)90072-H_BIB19","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TC.1986.1676763","article-title":"Fault-tolerant multiprocessors with redundant-path interconnection networks","volume":"C35","author":"Raghavendra","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90072-H_BIB20","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","article-title":"Parallel processing with a perfect shuffle","volume":"C-20","author":"Stone","year":"1971","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"10.1016\/0743-7315(91)90072-H_BIB21","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1109\/TC.1987.1676978","article-title":"On the permutation capability of multistage interconnection networks","volume":"C-36","author":"Szymanski","year":"1987","journal-title":"IEEE Trans. Comput."},{"article-title":"Design and analysis of reliable interconnection networks","year":"1986","author":"Varma","key":"10.1016\/0743-7315(91)90072-H_BIB22"},{"issue":"8","key":"10.1016\/0743-7315(91)90072-H_BIB23","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1109\/TC.1980.1675651","article-title":"On a class of multistage interconnection networks","volume":"C-29","author":"Wu","year":"1980","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0743-7315(91)90072-H_BIB24","first-page":"296","article-title":"An easily controlled network for frequently used permutations","volume":"C-30","author":"Yew","year":"1982","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:074373159190072H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190072H?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:31Z","timestamp":1757514511000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159190072H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["074373159190072H"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(91)90072-h","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1991,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An efficient method for representing and transmitting message patterns on multiprocessor interconnection networks","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)90072-H","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"}]}}