{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:24:30Z","timestamp":1757629470807,"version":"3.44.0"},"reference-count":31,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T00:00:00Z","timestamp":1108684800000},"content-version":"vor","delay-in-days":5680,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1989,8]]},"DOI":"10.1016\/0743-7315(89)90057-9","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"178-199","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Synthesizing minimum total expansion topologies for reconfigurable interconnection networks"],"prefix":"10.1016","volume":"7","author":[{"given":"David","family":"Smitley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Insup","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(89)90057-9_BIB1","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1109\/TC.1980.1675684","article-title":"Design of a massively parallel processor","author":"Batcher","year":"1980","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0743-7315(89)90057-9_BIB2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/MC.1982.1653826","article-title":"Introduction to the configurable, highly parallel computer","volume":"15","author":"Snyder","year":"1982","journal-title":"Computer"},{"key":"10.1016\/0743-7315(89)90057-9_BIB3","series-title":"Intermediate-Level Image Processing","article-title":"The V language for polymorphic architectures and algorithms","author":"Li","year":"1986"},{"key":"10.1016\/0743-7315(89)90057-9_BIB4","series-title":"Proc. of the first conf on Hypercube Multiprocessors","first-page":"7","article-title":"The Hypercube: A tutorial overview","author":"Heath","year":"1985"},{"article-title":"The utilization of processors interconnected with a reconfigurable network","year":"1987","author":"Smitley","key":"10.1016\/0743-7315(89)90057-9_BIB5"},{"issue":"6","key":"10.1016\/0743-7315(89)90057-9_BIB6","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1109\/12.2207","article-title":"A synthesis algorithm for reconfigurable interconnection networks","volume":"37","author":"Lee","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(89)90057-9_BIB7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF00288886","article-title":"Data encodings and their costs","volume":"9","author":"Rosenberg","year":"1978","journal-title":"Acta Inform."},{"issue":"5","key":"10.1016\/0743-7315(89)90057-9_BIB8","first-page":"23","article-title":"Evaluating the performance of multicomputer configurations","volume":"19","author":"Agrawal","year":"1986","journal-title":"Computer"},{"key":"10.1016\/0743-7315(89)90057-9_BIB9","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230040405","article-title":"A lower bound on the average shortest path length in regular graphs","volume":"4","author":"Cerf","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0743-7315(89)90057-9_BIB10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-7315(89)90057-9_BIB11","series-title":"Proc. 1983 ACM Symposium on Theory of Computing","first-page":"448","article-title":"An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems","author":"Gabow","year":"1983"},{"year":"1974","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/0743-7315(89)90057-9_BIB12"},{"key":"10.1016\/0743-7315(89)90057-9_BIB13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0196-6774(84)90030-0","article-title":"Generating random regular graphs","volume":"5","author":"Wormald","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0743-7315(89)90057-9_BIB14","series-title":"Surveys in Combinatorics","article-title":"Graphs and interconnection networks: Diameter and vulnerability","author":"Bermond","year":"1983"},{"key":"10.1016\/0743-7315(89)90057-9_BIB15","first-page":"1","article-title":"A partial census of trivalent generalized Moore networks","volume":"Vol. 452","author":"Cerf","year":"1975"},{"key":"10.1016\/0743-7315(89)90057-9_BIB16","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","article-title":"A probabilistic proof of an asymptotic formula for the number of labelled regular graphs","volume":"1","author":"Bollobas","year":"1980","journal-title":"European J. Combin."},{"key":"10.1016\/0743-7315(89)90057-9_BIB17","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/S0095-8956(81)80022-6","article-title":"The asymptotic distribution of short cycles in random regular graphs","volume":"31","author":"Wormald","year":"1981","journal-title":"J. Combin. Theory Ser. B"},{"year":"1985","series-title":"Graphical Evolution: An Introduction to the Theory of Random Graphs","author":"Palmer","key":"10.1016\/0743-7315(89)90057-9_BIB18"},{"key":"10.1016\/0743-7315(89)90057-9_BIB19","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01776564","article-title":"Bounds on the costs of data encodings","volume":"12","author":"Rosenberg","year":"1978","journal-title":"Math. Systems Theory"},{"issue":"3","key":"10.1016\/0743-7315(89)90057-9_BIB20","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","article-title":"On the mapping problem","volume":"C-30","author":"Bokhari","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"10.1016\/0743-7315(89)90057-9_BIB21","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/TC.1987.1676984","article-title":"Assignment of job modules onto array processors","volume":"C-36","author":"Fukunaga","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(89)90057-9_BIB22","series-title":"Tech. Rep.","article-title":"Revisiting the mapping problem","author":"Napolitano","year":"1986"},{"key":"10.1016\/0743-7315(89)90057-9_BIB23","series-title":"Proc. 1986 Optoelectronics and Laser Applications in Science and Engineering Conference","article-title":"The design of an optical network and its utilization","author":"Smitley","year":"1986"},{"key":"10.1016\/0743-7315(89)90057-9_BIB24","series-title":"Proc. 1986 International Conference on Parallel Processing","first-page":"401","article-title":"Optical matrix-vector implementation of crossbar interconnection networks","author":"Sawchuk","year":"1986"},{"key":"10.1016\/0743-7315(89)90057-9_BIB25","unstructured":"Meiko, Incorporated, The computing surface, 6201 Ascot Drive, Oakland CA 94611."},{"year":"1984","author":"Inmos, Limited","key":"10.1016\/0743-7315(89)90057-9_BIB26"},{"year":"1976","author":"Kleinrock","key":"10.1016\/0743-7315(89)90057-9_BIB27"},{"issue":"4","key":"10.1016\/0743-7315(89)90057-9_BIB28","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TC.1987.1676922","article-title":"Interprocessor traffic scheduling algorithm for multipleprocessor networks","volume":"C-36","author":"Bianchini","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(89)90057-9_BIB29","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230030202","article-title":"The flow deviation method\u2014An approach to store-and-forward communication network design","volume":"3","author":"Fratta","year":"1973","journal-title":"Networks"},{"issue":"2","key":"10.1016\/0743-7315(89)90057-9_BIB30","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TIT.1987.1057290","article-title":"The forwarding index of communication networks","volume":"IT-33","author":"Chung","year":"1987","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4598","key":"10.1016\/0743-7315(89)90057-9_BIB31","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900579?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900579?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:31:00Z","timestamp":1757514660000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731589900579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["0743731589900579"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(89)90057-9","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1989,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Synthesizing minimum total expansion topologies for reconfigurable 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(89)90057-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}