Abstract
Several existing studies have revealed that pipelined circuit switching (or PCS for short) can provide superior performance characteristics over wormhole switching. This paper proposes a new analytical model for PCS in high-radix high-dimensional k-ary n-cubes augmented with virtual channel support. The model uses Random Walk Theory to analyse the backtracking actions of the message header during the path set-up phase, and M/G/1 queueing systems to compute the mean waiting time that a message experiences at a source node before entering the network. Results from simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various network sizes and under different operating conditions.
Original language | English |
---|---|
Pages (from-to) | 111-126 |
Number of pages | 16 |
Journal | International Journal of High Speed Computing |
Volume | 11 |
Issue number | 2 |
DOIs | |
Publication status | Published - Jun 2000 |
Externally published | Yes |
Keywords
- Adaptive routing
- Backtracking
- Message latency
- Multicomputers
- Performance modelling
- Queueing theory
- Virtual channels
ASJC Scopus subject areas
- Theoretical Computer Science
- Computational Theory and Mathematics