Communication delay in hypercubes in the presence of bit-reversal traffic

H. Sarbazi-Azad, M. Ould-Khaoua, L. M. Mackenzie

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

A number of studies have recently proposed analytical models of adaptive routing in wormhole-switched hypercubes under the uniform traffic pattern. However, there has been hardly any work reported yet that deals with other important non-uniform traffic patterns found in many parallel applications. This paper describes a new analytical model of adaptive routing in wormhole-switched hypercubes in the presence of highly non-uniform traffic generated by bit-reversal permutations, which is an important communication operation in parallel applications such as FFT computations. The analysis focuses Duato's fully adaptive routing algorithm [J. Duato, IEEE Trans. Parallel Distrib. Syst. 4(12) (1993) 320], which is widely accepted as the most general algorithm for achieving adaptivity in wormhole-routed networks while allowing for an efficient router implementation. Results obtained through simulation experiments confirm that the proposed model exhibits a good degree of accuracy in predicting message latency under different traffic conditions.

Original languageEnglish
Pages (from-to)1801-1816
Number of pages16
JournalParallel Computing
Volume27
Issue number13
DOIs
Publication statusPublished - Dec 1 2001

Fingerprint

Communication Delay
Reversal
Hypercube
Adaptive Routing
Wormhole
Analytical models
Traffic
Communication
Parallel Applications
Routing algorithms
Adaptive algorithms
Routers
Fast Fourier transforms
Analytical Model
Adaptivity
Routing Algorithm
Router
Adaptive Algorithm
Simulation Experiment
Latency

Keywords

  • Adaptive routing
  • Bit-reversal permutation
  • Interconnection networks
  • Multicomputers
  • Non-uniform traffic
  • Performance modelling
  • Wormhole routing

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

Communication delay in hypercubes in the presence of bit-reversal traffic. / Sarbazi-Azad, H.; Ould-Khaoua, M.; Mackenzie, L. M.

In: Parallel Computing, Vol. 27, No. 13, 01.12.2001, p. 1801-1816.

Research output: Contribution to journalArticle

Sarbazi-Azad, H. ; Ould-Khaoua, M. ; Mackenzie, L. M. / Communication delay in hypercubes in the presence of bit-reversal traffic. In: Parallel Computing. 2001 ; Vol. 27, No. 13. pp. 1801-1816.
@article{3e6e47a9e2a84ea8a192a18765279e90,
title = "Communication delay in hypercubes in the presence of bit-reversal traffic",
abstract = "A number of studies have recently proposed analytical models of adaptive routing in wormhole-switched hypercubes under the uniform traffic pattern. However, there has been hardly any work reported yet that deals with other important non-uniform traffic patterns found in many parallel applications. This paper describes a new analytical model of adaptive routing in wormhole-switched hypercubes in the presence of highly non-uniform traffic generated by bit-reversal permutations, which is an important communication operation in parallel applications such as FFT computations. The analysis focuses Duato's fully adaptive routing algorithm [J. Duato, IEEE Trans. Parallel Distrib. Syst. 4(12) (1993) 320], which is widely accepted as the most general algorithm for achieving adaptivity in wormhole-routed networks while allowing for an efficient router implementation. Results obtained through simulation experiments confirm that the proposed model exhibits a good degree of accuracy in predicting message latency under different traffic conditions.",
keywords = "Adaptive routing, Bit-reversal permutation, Interconnection networks, Multicomputers, Non-uniform traffic, Performance modelling, Wormhole routing",
author = "H. Sarbazi-Azad and M. Ould-Khaoua and Mackenzie, {L. M.}",
year = "2001",
month = "12",
day = "1",
doi = "10.1016/S0167-8191(01)00112-0",
language = "English",
volume = "27",
pages = "1801--1816",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "13",

}

TY - JOUR

T1 - Communication delay in hypercubes in the presence of bit-reversal traffic

AU - Sarbazi-Azad, H.

AU - Ould-Khaoua, M.

AU - Mackenzie, L. M.

PY - 2001/12/1

Y1 - 2001/12/1

N2 - A number of studies have recently proposed analytical models of adaptive routing in wormhole-switched hypercubes under the uniform traffic pattern. However, there has been hardly any work reported yet that deals with other important non-uniform traffic patterns found in many parallel applications. This paper describes a new analytical model of adaptive routing in wormhole-switched hypercubes in the presence of highly non-uniform traffic generated by bit-reversal permutations, which is an important communication operation in parallel applications such as FFT computations. The analysis focuses Duato's fully adaptive routing algorithm [J. Duato, IEEE Trans. Parallel Distrib. Syst. 4(12) (1993) 320], which is widely accepted as the most general algorithm for achieving adaptivity in wormhole-routed networks while allowing for an efficient router implementation. Results obtained through simulation experiments confirm that the proposed model exhibits a good degree of accuracy in predicting message latency under different traffic conditions.

AB - A number of studies have recently proposed analytical models of adaptive routing in wormhole-switched hypercubes under the uniform traffic pattern. However, there has been hardly any work reported yet that deals with other important non-uniform traffic patterns found in many parallel applications. This paper describes a new analytical model of adaptive routing in wormhole-switched hypercubes in the presence of highly non-uniform traffic generated by bit-reversal permutations, which is an important communication operation in parallel applications such as FFT computations. The analysis focuses Duato's fully adaptive routing algorithm [J. Duato, IEEE Trans. Parallel Distrib. Syst. 4(12) (1993) 320], which is widely accepted as the most general algorithm for achieving adaptivity in wormhole-routed networks while allowing for an efficient router implementation. Results obtained through simulation experiments confirm that the proposed model exhibits a good degree of accuracy in predicting message latency under different traffic conditions.

KW - Adaptive routing

KW - Bit-reversal permutation

KW - Interconnection networks

KW - Multicomputers

KW - Non-uniform traffic

KW - Performance modelling

KW - Wormhole routing

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

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

U2 - 10.1016/S0167-8191(01)00112-0

DO - 10.1016/S0167-8191(01)00112-0

M3 - Article

VL - 27

SP - 1801

EP - 1816

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 13

ER -