Performance analysis of k-ary n-cube networks with pipelined circuit switching

G. Min, H. Sarbazi-Azad, M. Ould-Khaoua

Research output: Contribution to journalArticle

7 Citations (Scopus)

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 languageEnglish
Pages (from-to)111-126
Number of pages16
JournalInternational Journal of High Speed Computing
Volume11
Issue number2
DOIs
Publication statusPublished - Jun 2000

Fingerprint

K-ary N-cubes
Circuit Switching
Switching circuits
Performance Analysis
Wormhole Switching
Virtual Channel
Backtracking
Queueing System
Waiting Time
Analytical Model
Simulation Experiment
Analytical models
Random walk
High-dimensional
Path
Vertex of a graph
Model
Experiments
Experience

Keywords

  • Adaptive routing
  • Backtracking
  • Message latency
  • Multicomputers
  • Performance modelling
  • Queueing theory
  • Virtual channels

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Performance analysis of k-ary n-cube networks with pipelined circuit switching. / Min, G.; Sarbazi-Azad, H.; Ould-Khaoua, M.

In: International Journal of High Speed Computing, Vol. 11, No. 2, 06.2000, p. 111-126.

Research output: Contribution to journalArticle

@article{6ad7a6785d624c62b776d98c58f815f2,
title = "Performance analysis of k-ary n-cube networks with pipelined circuit switching",
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.",
keywords = "Adaptive routing, Backtracking, Message latency, Multicomputers, Performance modelling, Queueing theory, Virtual channels",
author = "G. Min and H. Sarbazi-Azad and M. Ould-Khaoua",
year = "2000",
month = "6",
doi = "10.1142/S0129053300000102",
language = "English",
volume = "11",
pages = "111--126",
journal = "International Journal of High Speed Computing",
issn = "0129-0533",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "2",

}

TY - JOUR

T1 - Performance analysis of k-ary n-cube networks with pipelined circuit switching

AU - Min, G.

AU - Sarbazi-Azad, H.

AU - Ould-Khaoua, M.

PY - 2000/6

Y1 - 2000/6

N2 - 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.

AB - 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.

KW - Adaptive routing

KW - Backtracking

KW - Message latency

KW - Multicomputers

KW - Performance modelling

KW - Queueing theory

KW - Virtual channels

UR - http://www.scopus.com/inward/record.url?scp=0034196967&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034196967&partnerID=8YFLogxK

U2 - 10.1142/S0129053300000102

DO - 10.1142/S0129053300000102

M3 - Article

AN - SCOPUS:0034196967

VL - 11

SP - 111

EP - 126

JO - International Journal of High Speed Computing

JF - International Journal of High Speed Computing

SN - 0129-0533

IS - 2

ER -