{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:16:46Z","timestamp":1648905406918},"reference-count":16,"publisher":"World Scientific Pub Co Pte Lt","issue":"01n02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2005,3]]},"abstract":"<jats:p> Recent studies have revealed that deadlocks are generally infrequent in the network. Thus the hardware resources, e.g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated the development of novel adaptive routing algorithms with deadlock recovery. This paper describes a new analytical model to predict message latency in hypercubes with a true fully adaptive routing algorithm with progressive deadlock recovery. One of the main features of the proposed model is the use of results from queueing systems with impatient customers to capture the effects of the timeout mechanism used in this routing algorithm for deadlock detection. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments. <\/jats:p>","DOI":"10.1142\/s012962640500212x","type":"journal-article","created":{"date-parts":[[2005,7,21]],"date-time":"2005-07-21T22:53:58Z","timestamp":1121986438000},"page":"153-168","source":"Crossref","is-referenced-by-count":5,"title":["A Performance Model of Software-Based Deadlock Recovery Routing Algorithm in Hypercubes"],"prefix":"10.1142","volume":"15","author":[{"given":"A.","family":"KHONSARI","sequence":"first","affiliation":[{"name":"School of Computer Science,  Institute for Studies in Fundamental Science (IPM), Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"SARBAZI-AZAD","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering,  Sharif University of Technology, School of Computer Science, Institute for Studies in Fundamental Science (IPM), Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"OULD-KHAOUA","sequence":"additional","affiliation":[{"name":"Department of Computing Science,  University of Glasgow, Glasgow, G12 8RZ, 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"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012962640500212X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:14:22Z","timestamp":1565093662000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012962640500212X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":16,"journal-issue":{"issue":"01n02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2005,3]]}},"alternative-id":["10.1142\/S012962640500212X"],"URL":"https:\/\/doi.org\/10.1142\/s012962640500212x","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,3]]}}}