PERFORMANCE EVALUATION OF ADAPTIVE AND FAULT TOLERANT WORMHOLE ROUTERS WITH COMPRESSIONLESS ROUTING

Abstract

In distributed parallel computers - tasks are executed by a set of intercommunicating nodes or processors. The communication is usually carried out by means of passing messages from one node to another over the interconnection. network. Various .adaptive routing techniques have been proposed as a way to improve network performance by providing multiple paths between a source and destination. While the techniques can produce higher utilization of network resources, increasing routing flexibility directly increases the possibilities of deadlock. The need for additional deadlock-prevention nlechanisrn can result in more complex and therefore, slower router implementations. In this dissertation, cr new adaptive routing fi'a,nework named compressionless Routing (CR) has been simulated and evaluated which provides a unified framework for efficient deadlock-free adaptive routing and fault-tolerance. Fault-tolerant compression less Routing (FCR) extends CR to support end-to-end fault-tolerant delivery. Besides, pelforinance of both CR and IiGR in torus and mesh has been evaluated with two important parameters of'CR namely timeout and retransmission lime gap.