Issue No. 02 - February (1998 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.663877
<p><b>Abstract</b>—The evaluation of advanced routing features must be based on both of costs and benefits. To date, adaptive routers have generally been evaluated on the basis of the achieved network throughput (channel utilization), ignoring the effects of implementation complexity. In this paper, we describe a parameterized cost model for router performance, characterized by two numbers: router delay and flow control time. Grounding the cost model in a 0.8 micron gate array technology, we use it to compare a number of proposed routing algorithms.</p><p>From these design studies, several insights into the implementation complexity of adaptive routers are clear. First, header update and selection is expensive in adaptive routers, suggesting that absolute addressing should be reconsidered. Second, virtual channels are expensive in terms of latency and cycle time, so decisions to include them to support adaptivity or even virtual lanes should not be taken lightly. Third, requirements of larger crossbars and more complex arbitration cause some increase in the complexity of adaptive routers, but the rate of increase is small. Last, the complexity of adaptive routers significantly increases their setup delay and flow control cycle times, implying that claims of performance advantages in channel utilization and low load latency must be carefully balanced against losses in achievable implementation speed.</p>
Routing networks, multicomputers, gate array, wormhole routing, adaptive routing, parallel computing, deadlock prevention.
A. A. Chien, "A Cost and Speed Model for k-ary n-Cube Wormhole Routers," in IEEE Transactions on Parallel & Distributed Systems, vol. 9, no. , pp. 150-162, 1998.