{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:24:47Z","timestamp":1757629487587,"version":"3.44.0"},"reference-count":8,"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\/"},{"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\/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,5]]},"DOI":"10.1016\/0743-7315(91)90030-d","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"70-73","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Design of nonequivalent self-routing networks based on a matrix model"],"prefix":"10.1016","volume":"12","author":[{"given":"P.","family":"Navaneethan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence","family":"Jenkins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(91)90030-D_BIB1","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1109\/12.2154","article-title":"Analysis and design of nonequivalent multistage interconnection networks","volume":"C-37","author":"Agrawal","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90030-D_BIB2","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/C-M.1981.220290","article-title":"A survey of interconnection networks","author":"Feng","year":"1981","journal-title":"IEEE Comput."},{"key":"10.1016\/0743-7315(91)90030-D_BIB3","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/TC.1986.1676800","article-title":"Finite state model and compatibility theory: New analysis tools for permutation networks","volume":"C-35","author":"Huang","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90030-D_BIB4","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1109\/T-C.1975.224157","article-title":"Access and alignment of data in array processors","volume":"C-24","author":"Lawrie","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90030-D_BIB5","unstructured":"Navaneethan P. POLYPEDS: A class of self-routing permutation networks for array processing systems. Ph.D. Thesis, Department of Electrical Engineering, Indian Institute of Science, Bangalore, India, in preparation."},{"key":"10.1016\/0743-7315(91)90030-D_BIB6","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1109\/TC.1981.1675695","article-title":"Performance of processor memory interconnections for multiprocessors","volume":"C-30","author":"Patel","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90030-D_BIB7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1109\/C-M.1981.220298","article-title":"The multistage cube: A versatile interconnection network","author":"Siegel","year":"1981","journal-title":"IEEE Comput."},{"key":"10.1016\/0743-7315(91)90030-D_BIB8","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."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190030D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190030D?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:17Z","timestamp":1757514497000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159190030D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["074373159190030D"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(91)90030-d","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1991,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Design of nonequivalent self-routing networks based on a matrix model","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)90030-D","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"}]}}