{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T15:33:22Z","timestamp":1648827202557},"reference-count":17,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2007,6]]},"abstract":"<jats:p> A number of analytical models for predicting message latency in k-ary n-cubes have recently been reported in the literature. Most of these models, however, have been discussed for adaptive routing algorithms based on deadlock avoidance, e.g. Duato's routing. Several research studies have empirically demonstrated that routing algorithms based on deadlock recovery offer maximal adaptivity that can result in considerable improvement in network performance. Disha is an example of a true fully adaptive routing algorithm that uses minimal hardware to implement a simple and efficient progressive method to recover from potential deadlocks. This paper proposes a new analytical model of Disha in wormhole-routed k-ary n-cubes. Simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various networks sizes and under different traffic conditions. <\/jats:p>","DOI":"10.1142\/s0129626407002971","type":"journal-article","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T09:44:20Z","timestamp":1183369460000},"page":"213-228","source":"Crossref","is-referenced-by-count":1,"title":["A PERFORMANCE MODEL OF DISHA ROUTING IN K-ARY N-CUBE NETWORKS"],"prefix":"10.1142","volume":"17","author":[{"given":"A.","family":"KHONSARI","sequence":"first","affiliation":[{"name":"Department of ECE, University of Tehran and IPM, School of Computer Science, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"SHAHRABI","sequence":"additional","affiliation":[{"name":"School of Computing &amp; Mathematical Sciences, Glasgow Caledonian University, G4 0BA, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"OULD-KHAOUA","sequence":"additional","affiliation":[{"name":"Department of Computing Science, University of Glasgow, Glasgow, G12 8QQ, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","first-page":"1001","volume":"38","author":"Abraham S.","journal-title":"IEEE Trans. Computers"},{"key":"rf4","first-page":"186","author":"Daley D. J.","journal-title":"Journal of Applied Probability"},{"key":"rf5","first-page":"547","volume":"36","author":"Dally W. J.","journal-title":"IEEE Trans. Computers"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1109\/71.127260"},{"key":"rf7","first-page":"202","volume":"32","author":"Draper J.","journal-title":"J. Parallel & Distributed Computing"},{"key":"rf8","first-page":"320","volume":"4","author":"Duato J.","journal-title":"IEEE Trans. Parallel & Distributed Systems"},{"key":"rf9","volume-title":"Interconnection networks: An engineering approach","author":"Duato J.","year":"1997"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S0164-1212(03)00008-6"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7906(03)00004-1"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1109\/71.584089"},{"key":"rf13","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1109\/12.293259","volume":"43","author":"Kim J.","journal-title":"IEEE Trans. Computers"},{"key":"rf14","volume-title":"Queueing Systems","volume":"1","author":"Kleinrock L.","year":"1975"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1109\/71.395404"},{"key":"rf19","first-page":"1","volume":"42","author":"Ould-Khaoua M.","journal-title":"IEEE Trans. Computers"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.2.162"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(00)00049-3"},{"key":"rf24","volume-title":"Stochastic modelling and analysis: A computational approach","author":"Tijms H. C."}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626407002971","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:14:46Z","timestamp":1565108086000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626407002971"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":17,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2007,6]]}},"alternative-id":["10.1142\/S0129626407002971"],"URL":"https:\/\/doi.org\/10.1142\/s0129626407002971","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6]]}}}