Sui, Pao-HwaPao-HwaSuiSHENG-DE WANG2018-09-102018-09-101999-1200200255http://scholars.lib.ntu.edu.tw/handle/123456789/352566https://www.scopus.com/inward/record.uri?eid=2-s2.0-0033364767&doi=10.1016%2fS0020-0255%2899%2900103-6&partnerID=40&md5=e9d44f7680d247ea9b921f349116e706Faulty blocks are expanded, by disabling nodes, to form rectangular faults in many existing works to facilitate the designing of deadlock-free routing schemes for meshes recently. In this paper, faulty blocks are diffused to be rectangular faults, which are composed of faulty and fault-diffused nodes. These rectangular faults are then shrunk, by recovering fault-diffused nodes, to form convex faults for reducing the number of nodes disabled. Simulation results show that up to 70% of the disabled nodes, which are needed to form rectangular faults, can be recovered if the number of faulty nodes is less than 10% of the total network nodes. Both non-adaptive and adaptive fault-tolerant routing algorithms are proposed to handle these resulted convex faults. The adaptive routing algorithm is enhanced from the non-adaptive counterpart by utilizing the virtual channels that are not used in the non-adaptive algorithm; hence, the number of virtual channels per physical channel used in the adaptive algorithm is the same to that used in the non-adaptive algorithm.application/pdfapplication/pdfAdaptive algorithms; Communication channels (information theory); Computer simulation; Congestion control (communication); Data communication systems; Fault tolerant computer systems; Telecommunication traffic; Virtual reality; Convex faults; Fault tolerant wormhole routing; Two-dimensional mesh networks; Computer networksjournal article10.1016/S0020-0255(99)00103-62-s2.0-0033364767WOS:000084696300003