Abstract
K-ary n-cubes have been one of the most popular interconnection networks for practical multicomputers due to their ease of implementation and ability to exploit communication locality found in many parallel applications. This paper describes an analytical model for k-ary n-cubes with dimension-ordered routing. The main feature of the model is its ability to captures network performance when an arbitrary number of virtual channels are used to reduce message blocking. Simulation experiments reveal that the latency results predicted by the analytical model are in good agreement with those provided by the simulation model.
| Original language | English |
|---|---|
| Pages (from-to) | 493-502 |
| Number of pages | 10 |
| Journal | Future Generation Computer Systems |
| Volume | 19 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - May 2003 |
| Externally published | Yes |
| Event | CCGrid 2002 - Berlin, Germany Duration: May 21 2002 → May 24 2002 |
Keywords
- Dimension-ordered routing
- M/G/1 queuing systems
- Message latency
- Multicomputer networks
- Virtual channel multiplexing
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Networks and Communications