Approximate performance model of a partially adaptive routing algorithm in hypercubes

M. Ould-Khaoua

doi:10.1016/S0141-9331(99)00046-0

Approximate performance model of a partially adaptive routing algorithm in hypercubes

M. Ould-Khaoua^*

^*Corresponding author for this work

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

Although several partially adaptive routing algorithms have been proposed in the literature, there has been hardly any study that describes analytical models for these algorithms. This paper proposes an approximate analytical model for obtaining latency measures in the hypercube with partially adaptive routing, based on the direction restriction model proposed by Boura and Das. Simulation experiments reveal that the analytical model yields accurate latency results.

Original language	English
Pages (from-to)	185-190
Number of pages	6
Journal	Microprocessors and Microsystems
Volume	23
Issue number	4
DOIs	https://doi.org/10.1016/S0141-9331(99)00046-0
Publication status	Published - Oct 11 1999

ASJC Scopus subject areas

Computer Networks and Communications
Hardware and Architecture
Software
Control and Systems Engineering
Electrical and Electronic Engineering

Access to Document

10.1016/S0141-9331(99)00046-0

Cite this

@article{b3a6ce25e02b461f8b6fc715cf59dc5c,

title = "Approximate performance model of a partially adaptive routing algorithm in hypercubes",

abstract = "Although several partially adaptive routing algorithms have been proposed in the literature, there has been hardly any study that describes analytical models for these algorithms. This paper proposes an approximate analytical model for obtaining latency measures in the hypercube with partially adaptive routing, based on the direction restriction model proposed by Boura and Das. Simulation experiments reveal that the analytical model yields accurate latency results.",

author = "M. Ould-Khaoua",

year = "1999",

month = oct,

day = "11",

doi = "10.1016/S0141-9331(99)00046-0",

language = "English",

volume = "23",

pages = "185--190",

journal = "Microprocessors and Microsystems",

issn = "0141-9331",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - Approximate performance model of a partially adaptive routing algorithm in hypercubes

AU - Ould-Khaoua, M.

PY - 1999/10/11

Y1 - 1999/10/11

N2 - Although several partially adaptive routing algorithms have been proposed in the literature, there has been hardly any study that describes analytical models for these algorithms. This paper proposes an approximate analytical model for obtaining latency measures in the hypercube with partially adaptive routing, based on the direction restriction model proposed by Boura and Das. Simulation experiments reveal that the analytical model yields accurate latency results.

AB - Although several partially adaptive routing algorithms have been proposed in the literature, there has been hardly any study that describes analytical models for these algorithms. This paper proposes an approximate analytical model for obtaining latency measures in the hypercube with partially adaptive routing, based on the direction restriction model proposed by Boura and Das. Simulation experiments reveal that the analytical model yields accurate latency results.

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

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

U2 - 10.1016/S0141-9331(99)00046-0

DO - 10.1016/S0141-9331(99)00046-0

M3 - Article

AN - SCOPUS:0032594825

VL - 23

SP - 185

EP - 190

JO - Microprocessors and Microsystems

JF - Microprocessors and Microsystems

SN - 0141-9331

IS - 4

ER -

Approximate performance model of a partially adaptive routing algorithm in hypercubes

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this