Wormhole routing techniques for directly connected multicomputer systems

摘要: Wormhole routing has emerged as the most widely used switching technique in massively parallel computers. We present a detailed survey of various techniques for enhancing performance and reliability wormhole-routing schemes directly connected networks. start with an overview direct network topologies comparison techniques. Next, characteristics wormhole mechanism are described detail along theory behind deadlock-free routing. The algorithms depends on selection path between source destination, traffic, router design. implemented chips. outline describe functionality elements router. Depending usage paths classified deterministic, fully adaptive, partially adaptive. discuss several representative all these categories. within each category vary terms resource requirements under traffic conditions. main difference among adaptive is to avoid deadlocks. also few based deadlock recovery Along performance, fault tolerance essential message multicomputers, we thus fault-tolerant their fault-handling capabilities. These enable reach its destination even presence faults network. implementation details contemporary commercial systems discussed. conclude by itemizing future directions open issues.