作者: Ran Libeskind-Hadas , Eli Brandt
DOI: 10.1016/0167-739X(95)00027-P
关键词: Link-state routing protocol 、 Destination-Sequenced Distance Vector routing 、 Computer science 、 Mesh networking 、 Router 、 Static routing 、 Distributed computing 、 Deadlock 、 Fault tolerance 、 Interconnection 、 Adaptive routing 、 Routing (electronic design automation) 、 Parallel computing 、 Dynamic Source Routing
摘要: The ability to tolerate faults is critical in multi-computers employing large numbers of processors. This paper describes a class fault-tolerant routing algorithms for n-dimensional meshes that can without using virtual channels. We show these prevent livelock and deadlock while remaining highly adaptive. >