Issue No. 05 - May (1998 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.679218
<p><b>Abstract</b>—This paper identifies performance degradation in wormhole routed <it>k</it>-ary <it>n</it>-cube networks due to limited number of router-to-processor <it>consumption</it> channels at each node. Many recent research in wormhole routing have advocated the advantages of <it>adaptive routing</it> and <it>virtual channel flow control</it> schemes to deliver better network performance. This paper indicates that the advantages associated with these schemes cannot be realized with limited consumption capacity. To alleviate such performance bottlenecks, a new network interface design using <it>multiple</it> consumption channels is proposed. To match virtual multiplexing on network channels, we also propose each consumption channel to support multiple virtual consumption channels. The impact of message arrival rate at a node on the required number of consumption channels is studied analytically. It is shown that wormhole networks with higher routing adaptivity, dimensionality, degree of hot-spot traffic, and number of virtual lanes have to take advantage of multiple consumption channels to deliver better performance. The interplay between system topology, routing algorithm, number of virtual lanes, messaging overheads, and communication traffic is studied through simulation to derive the <it>effective</it> number of consumption channels required in a system. Using the ongoing technological trend, it is shown that wormhole-routed systems can use up to two-four consumption channels per node to deliver better system performance.</p>
Parallel computer architecture, wormhole routing, k-ary n-cube, consumption channel, virtual channel, deterministic routing, adaptive routing, hot-spot traffic, and interprocessor communication.
D. Basak and D. K. Panda, "Alleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary n-Cube Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 9, no. , pp. 481-496, 1998.