The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (1994 vol.5)
pp: 225-246
ABSTRACT
<p>This paper develops detailed analytical performance models for k-ary n-cube networkswith single-hit or infinite buffers, wormhole routing, and the nonadaptive deadlock-freerouting scheme proposed by Dally and Seitz (1987). In contrast to previous performancestudies of such networks, the system is modeled as a closed queueing network that:includes the effects of blocking and pipelining of messages in the network; allows forarbitrary source-destination probability distributions; and explicitly models the virtualchannels used in the deadlock-free routing algorithm. The models are used to examineseveral performance issues for 2-D networks with shared-memory traffic. These resultsshould prove useful for engineering high-performance systems based on low-dimensional k-ary n-cube networks.</p>
INDEX TERMS
Index Termsmultiprocessor interconnection networks; concurrency control; performance evaluation;probability; queueing theory; network routing; mesh interconnection networks;deterministic routing; performance analysis; k-ary n-cube networks; single-hit buffers;infinite buffers; wormhole routing; nonadaptive deadlock-free routing scheme; closedqueueing network; message blocking; message pipelining; arbitrary source-destinationprobability distribution; virtual channels; deadlock-free routing algorithm; performance issues; 2D networks; shared-memory traffic; two dimensional network
CITATION
V.S. Adve, "Performance Analysis of Mesh Interconnection Networks with Deterministic Routing", IEEE Transactions on Parallel & Distributed Systems, vol.5, no. 3, pp. 225-246, March 1994, doi:10.1109/71.277793
29 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool