The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1995 vol.6)
pp: 482-497
ABSTRACT
<p><it>Abstract—</it>Our goal is to reconcile the conflicting demands of performance and fault-tolerance in interprocessor communication. To this end, we propose a pipelined communication mechanism—pipelined circuit-switching (PCS)—which is a variant of the well known wormhole routing (WR) mechanism. PCS relaxes some of the routing constraints imposed by WR and as a result enables routing behavior that cannot otherwise be realized. This paper presents a new class of adaptive routing algorithms—misrouting backtracking with <math><tmath>$m$</tmath></math> misroutes (MB-<math><tmath>$m$</tmath></math>). This class of routing algorithms is made possible by PCS. We provide an analysis of the performance and static fault-tolerant properties of MB-<math><tmath>$m$</tmath></math>. The results of an experimental evaluation of PCS and MB-3 are also presented. This methodology provides performance approaching that of WR, while realizing a level of resilience to static faults that is difficult to achieve with WR.</p>
CITATION
Patrick T. Gaughan, Sudhakar Yalamanchili, "A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks", IEEE Transactions on Parallel & Distributed Systems, vol.6, no. 5, pp. 482-497, May 1995, doi:10.1109/71.382317
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool