{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T00:05:13Z","timestamp":1705017913430},"reference-count":17,"publisher":"Oxford University Press (OUP)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1093\/comjnl\/bxw040","type":"journal-article","created":{"date-parts":[[2016,8,23]],"date-time":"2016-08-23T01:59:07Z","timestamp":1471917547000},"page":"1511-1526","source":"Crossref","is-referenced-by-count":10,"title":["RSD Fault Block Model for Highly Efficient Fault-Tolerant Manhattan Routing Algorithms in 2D Mesh"],"prefix":"10.1093","volume":"59","author":[{"given":"Hongzhi","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Yuan","family":"Xue","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2016,8,22]]},"reference":[{"key":"2017011902300831000_59.10.1511.1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.1996.4772741"},{"key":"2017011902300831000_59.10.1511.2","doi-asserted-by":"crossref","unstructured":"Benoit, A. , Melhem, R. , Renaud-Goud, P. and Robert, Y. (2012) Power-aware manhattan routing on chip multiprocessors. In 2012 IEEE 26th Int. Parall. Distrib. Process. Symposium (IPDPS), Shanghai, China, May 21\u201325, pp. 189\u2013200. IEEE Press, Piscataway, NJ.","DOI":"10.1109\/IPDPS.2012.27"},{"key":"2017011902300831000_59.10.1511.3","doi-asserted-by":"crossref","unstructured":"Rodrigo, S. , Flich, J. , Roca, A. , Medardoni, S. , Bertozzi, D. , Camacho, J. , Silla, F. and Duato, J. (2010) Addressing manufacturing challenges with cost-efficient fault tolerant routing. In 2010 4th ACM\/IEEE Int. Symposium on Networks-on-Chip (NOCS), Grenoble, France, May 3\u20136, pp. 25\u201332. IEEE Press. Piscataway, NJ.","DOI":"10.1109\/NOCS.2010.12"},{"key":"2017011902300831000_59.10.1511.4","doi-asserted-by":"crossref","unstructured":"Zimmer, C. and Mueller, F. (2014) Nocmsg: Scalable noc-based message passing. In 2014 14th IEEE\/ACM Int. Symposium on Cluster, Cloud and Grid Computing (CCGrid), Chicago, IL, USA, May 26\u201329, pp. 186\u2013195. IEEE Press. Piscataway, NJ.","DOI":"10.1109\/CCGrid.2014.19"},{"key":"2017011902300831000_59.10.1511.5","doi-asserted-by":"crossref","unstructured":"Yang, Y. , Quan, H. , Shi, Z. , Zeng, X. and Yu, Z. (2011) Modified minimal-connected-component fault block model to deal with defective links and nodes for 2d-mesh nocs. In 2011 IEEE 9th Int. Conf. on ASIC (ASICON), Xiamen, China, October 25\u201328, pp. 267\u2013270. IEEE Press. Piscataway, NJ.","DOI":"10.1109\/ASICON.2011.6157173"},{"key":"2017011902300831000_59.10.1511.6","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1183946"},{"key":"2017011902300831000_59.10.1511.7","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2007.909768"},{"key":"2017011902300831000_59.10.1511.8","doi-asserted-by":"publisher","DOI":"10.1109\/12.392844"},{"key":"2017011902300831000_59.10.1511.9","doi-asserted-by":"publisher","DOI":"10.1109\/71.841751"},{"key":"2017011902300831000_59.10.1511.10","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200856"},{"key":"2017011902300831000_59.10.1511.11","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2012.2235188"},{"key":"2017011902300831000_59.10.1511.12","doi-asserted-by":"publisher","DOI":"10.1109\/12.506423"},{"key":"2017011902300831000_59.10.1511.13","doi-asserted-by":"crossref","unstructured":"Boppana, R.V. and Chalasani, S. (1994) Fault-tolerant routing with non-adaptive wormhole algorithms in mesh networks. In Proc.1994 ACM\/IEEE Conf. Supercomputing, Washington, DC, USA, November 14\u201318, pp. 693\u2013702. IEEE Computer Society Press. Los Alamitos, CA.","DOI":"10.1109\/SUPERC.1994.344335"},{"key":"2017011902300831000_59.10.1511.14","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2009.3"},{"key":"2017011902300831000_59.10.1511.15","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.1142\/S0129054108006285","article-title":"On achieving the shortest002Dpath routing in 2-d meshes","volume":"19","author":"Jiang","year":"2008","journal-title":"Int. J. Found.Comput. Sci."},{"key":"2017011902300831000_59.10.1511.16","doi-asserted-by":"crossref","unstructured":"Manevich, R. , Cidon, I. , Kolodny, A. , Walter, I. and Wimer, S. (2011) A cost effective centralized adaptive routing for networks-on-chip. In 2011 14th Euromicro Conf. on Digital System Design (DSD), Oulu, Finland, August 31\u2013September 2, pp. 39\u201346. IEEE Press, Piscataway, NJ.","DOI":"10.1109\/DSD.2011.10"},{"key":"2017011902300831000_59.10.1511.17","doi-asserted-by":"crossref","unstructured":"Ramanujam, R.S. and Lin, B. (2010) Destination-based adaptive routing on 2d mesh networks. In 2010 ACM\/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), La Jolla, CA, USA, October 25\u201326, pp. 1\u201312. IEEE Press, Piscataway, NJ.","DOI":"10.1145\/1872007.1872030"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/59\/10\/1511\/10322728\/bxw040.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T21:26:59Z","timestamp":1568323619000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxw040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,22]]},"references-count":17,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2016,10,14]]},"published-print":{"date-parts":[[2016,10]]}},"alternative-id":["10.1093\/comjnl\/bxw040"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxw040","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,22]]}}}