A model of adaptive routing in the hypercube has recently been proposed. Modelling adaptive routing in a high-radix k-ary n-cube, e.g., the torus, is more complicated than in the hypercube since a message in the former may cross more than one channel along a given dimension. This paper proposes a queuing model of adaptive routing in the torus. The validity of the model is demonstrated by comparing analytical results with those obtained through simulations.
ASJC Scopus subject areas
- Computer Science Applications
- Hardware and Architecture
- Control and Systems Engineering