{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T10:11:06Z","timestamp":1649153466402},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"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":["Future Generation Computer Systems"],"published-print":{"date-parts":[[1994,4]]},"DOI":"10.1016\/0167-739x(94)90050-7","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T15:12:00Z","timestamp":1062601920000},"page":"45-58","source":"Crossref","is-referenced-by-count":10,"title":["Improving the efficiency of virtual channels with time-dependent selection functions"],"prefix":"10.1016","volume":"10","author":[{"given":"Jos\u00e9","family":"Duato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/0167-739X(94)90050-7_BIB1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/2.73","article-title":"Multicomputers: message-passing concurrent computers","volume":"21","author":"Athas","year":"1988","journal-title":"IEEE Comput."},{"key":"10.1016\/0167-739X(94)90050-7_BIB2","series-title":"Proc. Supercomputing '88","article-title":"iWarp: an integrated solution to high-speed parallel computing","author":"Borkar","year":"1988"},{"issue":"4","key":"10.1016\/0167-739X(94)90050-7_BIB3","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1109\/TCOM.1981.1095005","article-title":"The need for adaptive routing in the chaotic and unbalanced traffic environment","volume":"29","author":"Chou","year":"1981","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0167-739X(94)90050-7_BIB4","series-title":"Proc. 15th Int. Symp. Computer Architecture","article-title":"Hyperswitch network for the hypercube computer","author":"Chow","year":"1988"},{"issue":"3","key":"10.1016\/0167-739X(94)90050-7_BIB5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01660031","article-title":"The torus routing chip","volume":"1","author":"Dally","year":"1986","journal-title":"Distributed Comput."},{"issue":"5","key":"10.1016\/0167-739X(94)90050-7_BIB6","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TC.1987.1676939","article-title":"Deadlock-free message routing in multiprocessor interconnection networks","volume":"36","author":"Dally","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-739X(94)90050-7_BIB7","series-title":"Proc. 3rd Conf. on Hypercube Concurrent Computers & Applications","article-title":"Fine-grain concurrent computers","author":"Dally","year":"1988"},{"key":"10.1016\/0167-739X(94)90050-7_BIB8","series-title":"Proc. 17th Int. Symp. Computer Architecture","article-title":"Virtual-channel flow control","author":"Dally","year":"1990"},{"issue":"6","key":"10.1016\/0167-739X(94)90050-7_BIB9","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1109\/12.53599","article-title":"Performance analysis of k-ary n-cube interconnection networks","volume":"39","author":"Dally","year":"1990","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/0167-739X(94)90050-7_BIB10","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/71.127260","article-title":"Virtual-channel flow control","volume":"3","author":"Dally","year":"1992","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"issue":"4","key":"10.1016\/0167-739X(94)90050-7_BIB11","article-title":"Deadlock-free adaptive routing algorithms for multicomputers","volume":"10","author":"Duato","year":"1991","journal-title":"Technique et Science Informatiques"},{"key":"10.1016\/0167-739X(94)90050-7_BIB12","series-title":"Proc. 2nd European Distributed Memory Computing Conf.","article-title":"On the design of deadlock-free adaptive routing algorithms for multicomputers: theoretical aspects","author":"Duato","year":"1991"},{"key":"10.1016\/0167-739X(94)90050-7_BIB13","series-title":"Proc. Parallel Architectures and Languages Europe 91","article-title":"On the design of deadlock-free adaptive routing algorithms for multicomputers: design methodologies","author":"Duato","year":"1991"},{"key":"10.1016\/0167-739X(94)90050-7_BIB14","series-title":"Proc. 3rd IEEE Int. Symp. on Parallel and Distributed Processing","article-title":"Deadlock-free adaptive routing algorithms for multicomputers: evaluation of a new algorithm","author":"Duato","year":"1991"},{"key":"10.1016\/0167-739X(94)90050-7_BIB15","series-title":"Proc. European Workshop on Parallel Computing 92","article-title":"Impact of locality on the performance of some adaptive routing algorithms for the hypercube","author":"Duato","year":"1992"},{"key":"10.1016\/0167-739X(94)90050-7_BIB16","article-title":"Study of communication mechanisms for a massively parallel machine: MEGA","author":"Germain","year":"1989"},{"key":"10.1016\/0167-739X(94)90050-7_BIB17","series-title":"Proc. 2nd European Distributed Memory Computing Conf.","article-title":"Performance benefits from locally adaptive interval routing in dynamically switched interconnection networks","author":"Hofest\u00e4dt","year":"1991"},{"key":"10.1016\/0167-739X(94)90050-7_BIB18","series-title":"Proc. 16th Int. Symp. Computer Architecture","article-title":"High performance communications in processor networks","author":"Jesshope","year":"1989"},{"key":"10.1016\/0167-739X(94)90050-7_BIB19","series-title":"Proc. 3rd Conf. on Hypercube Concurrent Computers and Applications","article-title":"Adaptive packet routing in a hypercube","author":"Kim","year":"1988"},{"key":"10.1016\/0167-739X(94)90050-7_BIB20","series-title":"Proc. 15th Int. Symp. Computer Architecture","article-title":"Deadlock avoidance for systolic communication","author":"Kung","year":"1988"},{"issue":"1","key":"10.1016\/0167-739X(94)90050-7_BIB21","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/12.67315","article-title":"An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes","volume":"40","author":"Linder","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-739X(94)90050-7_BIB22","series-title":"Proc. 3rd Conf. on Hypercube Concurrent Computers and Applications","article-title":"Message routing schemes in a hypercube machine","author":"Ragupathy","year":"1988"},{"issue":"6","key":"10.1016\/0167-739X(94)90050-7_BIB23","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/MC.1987.1663593","article-title":"The performance of multicomputer interconnection networks","volume":"20","author":"Reed","year":"1987","journal-title":"IEEE Comput."},{"key":"10.1016\/0167-739X(94)90050-7_BIB24","series-title":"Proc. 4th Conf. on Hypercube Concurrent Computers and Applications","article-title":"Adaptive routing and deadlock recovery: a simulation study","author":"Reeves","year":"1989"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167739X94900507?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167739X94900507?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T11:54:16Z","timestamp":1551095656000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167739X94900507"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["0167739X94900507"],"URL":"https:\/\/doi.org\/10.1016\/0167-739x(94)90050-7","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}