{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T01:27:03Z","timestamp":1676683623066},"reference-count":24,"publisher":"Elsevier BV","issue":"13-15","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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 Systems Architecture"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s1383-7621(03)00025-0","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T01:09:24Z","timestamp":1052788164000},"page":"387-402","source":"Crossref","is-referenced-by-count":7,"title":["Permutation routing in double-loop networks: design and empirical evaluation"],"prefix":"10.1016","volume":"48","author":[{"given":"Toma\u017e","family":"Dobravec","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Borut","family":"Robi\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janez","family":"\u017derovnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1383-7621(03)00025-0_BIB1","unstructured":"L.D. Aronson, Networks and routing\u2013\u2013a survey. Technical Report 94-112, Faculty of Technical Mathematics and Computer Science, Delft University of Technology, 1994"},{"key":"10.1016\/S1383-7621(03)00025-0_BIB2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","article-title":"Distributed loop computer networks: a survey","volume":"24","author":"Bermond","year":"1995","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S1383-7621(03)00025-0_BIB3","doi-asserted-by":"crossref","unstructured":"J. Cai, G. Havas, B. Mans, A. Nerurkar, I. Shparlinski, On routing in circulant graphs. Technical report, State University of NY at Buffalo, USA; The University of Queensland, Australia; Macquarie University, Australia, 1999","DOI":"10.1007\/3-540-48686-0_36"},{"key":"10.1016\/S1383-7621(03)00025-0_BIB4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0024-3795(98)10126-X","article-title":"On some combinatorial questions related to circulant graphs","volume":"285","author":"Codenotti","year":"1998","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S1383-7621(03)00025-0_BIB5","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/021\/05","article-title":"Permutation routing via cayley graphs with example for bus inteconnection networks","volume":"21","author":"Cooperman","year":"1995","journal-title":"DIMACS Ser. Discrete Math. Theor. Comp. Sci."},{"key":"10.1016\/S1383-7621(03)00025-0_BIB6","series-title":"Parallel Computer Architecture; A Hardware\/Software Approach","author":"Culler","year":"1999"},{"key":"10.1016\/S1383-7621(03)00025-0_BIB7","series-title":"Circulant Matrices","author":"Davis","year":"1979"},{"key":"10.1016\/S1383-7621(03)00025-0_BIB8","unstructured":"T. Dobravec, B. Robi\u010d, B. Vilfan, Routing in double-loop networks, in: Proceedings of the IASTED International Symposia Applied Informatics, Innsbruck, Austria, February 2001, pp. 408\u2013411"},{"key":"10.1016\/S1383-7621(03)00025-0_BIB9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0166-218X(97)00015-2","article-title":"Fault-tolerant routing in double fixed-step network","volume":"78","author":"F\u00e0brega","year":"1997","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"10.1016\/S1383-7621(03)00025-0_BIB10","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1109\/TC.1987.1676963","article-title":"A discrete optimization problem in local networks and data alignment","volume":"36","author":"Fiol","year":"1987","journal-title":"IEEE Trans. Comput. C"},{"key":"10.1016\/S1383-7621(03)00025-0_BIB11","doi-asserted-by":"crossref","unstructured":"G. Gauyacq, C. Micheneau, A. Raspaud, Routing in recursive circulant graphs: edge-forwarding index and hamiltonian decomposition, in: J. Hromkovic, O. Sijkora (Eds.), Graph-Theoretic Concepts in Computer Science, WG\u201998, Lecture Notes in Computer Science, 1998, pp. 227\u2013241","DOI":"10.1007\/10692760_19"},{"key":"10.1016\/S1383-7621(03)00025-0_BIB12","unstructured":"M.D. Grammatikakis. Personal e-mail communication"},{"issue":"PC981483","key":"10.1016\/S1383-7621(03)00025-0_BIB13","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1006\/jpdc.1998.1483","article-title":"Packet routing in fixed-connection networks: a survey","volume":"54","author":"Grammatikakis","year":"1998","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S1383-7621(03)00025-0_BIB14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0020-0190(98)00013-1","article-title":"An optimal message routing algorithm for double-loop networks","volume":"65","author":"Guan","year":"1998","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"10.1016\/S1383-7621(03)00025-0_BIB15","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1142\/S0129626497000279","article-title":"A permutation routing algorithm for double loop network","volume":"7","author":"Hwang","year":"1997","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S1383-7621(03)00025-0_BIB16","series-title":"Introduction to Parallel Computing: Design and Analysis of Algorithms","author":"Kumar","year":"1994"},{"key":"10.1016\/S1383-7621(03)00025-0_BIB17","series-title":"Introduction to Parallel Algorithms and Architectures","author":"Leighton","year":"1992"},{"key":"10.1016\/S1383-7621(03)00025-0_BIB18","unstructured":"B. Robi\u010d, Optimal routing in 2-jump circulant networks, Technical Report 397, University of Cambridge, UK, Computer Laboratory, 1996"},{"issue":"1","key":"10.1016\/S1383-7621(03)00025-0_BIB19","first-page":"37","article-title":"Minimum 2-terminal routing in 2-jump circular graphs","volume":"19","author":"Robi\u010d","year":"2000","journal-title":"Comput. Artificial Intell."},{"key":"10.1016\/S1383-7621(03)00025-0_BIB20","unstructured":"J. Sibeyn, Personal e-mail communication"},{"key":"10.1016\/S1383-7621(03)00025-0_BIB21","series-title":"Interconnection Networks for Large-Scale Parallel Processing","author":"Siegel","year":"1990"},{"key":"10.1016\/S1383-7621(03)00025-0_BIB22","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1006\/jagm.1993.1011","article-title":"Computing the diameter in multiple-loop networks","volume":"14","author":"\u017derovnik","year":"1993","journal-title":"J. Algorith."},{"key":"10.1016\/S1383-7621(03)00025-0_BIB23","unstructured":"J. \u017derovnik, B. Robi\u010d, T. Dobravec, Optimal permutation routing in 2-jump circulant networks, in: Proceedings of ACIS 1st International Conference on Software Engineering Applied to Networking and Parallel\/Distributed Computing SNPD, Reims, France, 18\u201321 May 2000, pp. 175\u2013180"},{"key":"10.1016\/S1383-7621(03)00025-0_BIB24","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1145\/321832.321838","article-title":"A combinatorial problem related to multimode memory organizations","volume":"21","author":"Wong","year":"1974","journal-title":"J. ACM"}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762103000250?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762103000250?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T17:16:13Z","timestamp":1584638173000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1383762103000250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":24,"journal-issue":{"issue":"13-15","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S1383762103000250"],"URL":"https:\/\/doi.org\/10.1016\/s1383-7621(03)00025-0","relation":{},"ISSN":["1383-7621"],"issn-type":[{"value":"1383-7621","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}