Abstract
Analytical models of deterministic routing in wormhole-routed k-ary n-cubes have widely been reported in the literature. Although many fully adaptive routing algorithms have been proposed to overcome the performance limitations of deterministic routing, there have been hardly any studies that describe analytical models for these algorithms. This paper proposes a new analytical model for obtaining latency measures in high-radix k-ary n-cubes with fully adaptive routing, based on Duato's algorithm [10]. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.
Original language | English |
---|---|
Pages (from-to) | 1297-1304 |
Number of pages | 8 |
Journal | IEEE Transactions on Computers |
Volume | 48 |
Issue number | 12 |
DOIs | |
Publication status | Published - Dec 1999 |
Externally published | Yes |
Keywords
- Adaptive routing
- Deterministic routing
- Interconnection networks
- Message latency
- Multicomputers
- Performance modeling
- Virtual channels
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics