Compressionless wormhole routing

An analysis for hypercube with virtual channels

Ahmad Khonsari, Mohamed Ould-Khaoua

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Several recent studies have shown that adaptive routing algorithms based on deadlock recovery have superior performance characteristics than those based on deadlock avoidance. Most of these studies, however, have relied on software simulation due to the lack of analytical modelling tools. In an effort towards filling this gap, this paper presents a new analytical model of compressionless routing in wormhole-routed hypercubes. This routing algorithm exploits the tight coupling between wormhole routers for flow control to detect and recover from potential deadlock situations. The advantages of compressionless routing include deadlock-free adaptive routing with no extra virtual channels, simple router design, and order-preserving message transmission. The proposed analytical model computes message latency by determining the message transmission time, blocking delay at each router, multiplexing delay at each network channel, and waiting time in the source before entering the network. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

Original languageEnglish
Pages (from-to)45-60
Number of pages16
JournalComputers and Electrical Engineering
Volume30
Issue number1
DOIs
Publication statusPublished - Jan 2004

Fingerprint

Routers
Routing algorithms
Analytical models
Adaptive algorithms
Multiplexing
Flow control
Recovery
Experiments

Keywords

  • Compressionless routing
  • Fully adaptive routing
  • Interconnection networks
  • Multicomputers
  • Performance modelling
  • Virtual channels

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Compressionless wormhole routing : An analysis for hypercube with virtual channels. / Khonsari, Ahmad; Ould-Khaoua, Mohamed.

In: Computers and Electrical Engineering, Vol. 30, No. 1, 01.2004, p. 45-60.

Research output: Contribution to journalArticle

@article{3462768f88dd4b2489df4dfe36d5bd66,
title = "Compressionless wormhole routing: An analysis for hypercube with virtual channels",
abstract = "Several recent studies have shown that adaptive routing algorithms based on deadlock recovery have superior performance characteristics than those based on deadlock avoidance. Most of these studies, however, have relied on software simulation due to the lack of analytical modelling tools. In an effort towards filling this gap, this paper presents a new analytical model of compressionless routing in wormhole-routed hypercubes. This routing algorithm exploits the tight coupling between wormhole routers for flow control to detect and recover from potential deadlock situations. The advantages of compressionless routing include deadlock-free adaptive routing with no extra virtual channels, simple router design, and order-preserving message transmission. The proposed analytical model computes message latency by determining the message transmission time, blocking delay at each router, multiplexing delay at each network channel, and waiting time in the source before entering the network. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.",
keywords = "Compressionless routing, Fully adaptive routing, Interconnection networks, Multicomputers, Performance modelling, Virtual channels",
author = "Ahmad Khonsari and Mohamed Ould-Khaoua",
year = "2004",
month = "1",
doi = "10.1016/S0045-7906(03)00004-1",
language = "English",
volume = "30",
pages = "45--60",
journal = "Computers and Electrical Engineering",
issn = "0045-7906",
publisher = "Elsevier Limited",
number = "1",

}

TY - JOUR

T1 - Compressionless wormhole routing

T2 - An analysis for hypercube with virtual channels

AU - Khonsari, Ahmad

AU - Ould-Khaoua, Mohamed

PY - 2004/1

Y1 - 2004/1

N2 - Several recent studies have shown that adaptive routing algorithms based on deadlock recovery have superior performance characteristics than those based on deadlock avoidance. Most of these studies, however, have relied on software simulation due to the lack of analytical modelling tools. In an effort towards filling this gap, this paper presents a new analytical model of compressionless routing in wormhole-routed hypercubes. This routing algorithm exploits the tight coupling between wormhole routers for flow control to detect and recover from potential deadlock situations. The advantages of compressionless routing include deadlock-free adaptive routing with no extra virtual channels, simple router design, and order-preserving message transmission. The proposed analytical model computes message latency by determining the message transmission time, blocking delay at each router, multiplexing delay at each network channel, and waiting time in the source before entering the network. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

AB - Several recent studies have shown that adaptive routing algorithms based on deadlock recovery have superior performance characteristics than those based on deadlock avoidance. Most of these studies, however, have relied on software simulation due to the lack of analytical modelling tools. In an effort towards filling this gap, this paper presents a new analytical model of compressionless routing in wormhole-routed hypercubes. This routing algorithm exploits the tight coupling between wormhole routers for flow control to detect and recover from potential deadlock situations. The advantages of compressionless routing include deadlock-free adaptive routing with no extra virtual channels, simple router design, and order-preserving message transmission. The proposed analytical model computes message latency by determining the message transmission time, blocking delay at each router, multiplexing delay at each network channel, and waiting time in the source before entering the network. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

KW - Compressionless routing

KW - Fully adaptive routing

KW - Interconnection networks

KW - Multicomputers

KW - Performance modelling

KW - Virtual channels

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

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

U2 - 10.1016/S0045-7906(03)00004-1

DO - 10.1016/S0045-7906(03)00004-1

M3 - Article

VL - 30

SP - 45

EP - 60

JO - Computers and Electrical Engineering

JF - Computers and Electrical Engineering

SN - 0045-7906

IS - 1

ER -