A performance model for Duato´s fully adaptive routing algorithm in k-ary n-cubes

Author

Ould-Khaoua, Mohamed

Author_Institution

Dept. of Comput. Sci., Strathclyde Univ., Glasgow, UK

Volume

48

Issue

12

fYear

1999

fDate

12/1/1999 12:00:00 AM

Firstpage

1297

Lastpage

1304

Abstract

Analytical models of deterministic routing in wormhole-routed k-ary n-cubes have widely been reported in the literature. Although many fully adaptive routing algorithms have been proposed to overcome the performance limitations of deterministic routing, there have been hardly any studies that describe analytical models for these algorithms. This paper proposes a new analytical model for obtaining latency measures in high-radix k-ary n-cubes with fully adaptive routing, based on Duato´s algorithm (1998). The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments

Keywords

hypercube networks; analytical model; deterministic routing; fully adaptive routing algorithm; interconnection networks; k-ary n-cubes; latency measures; message latency; multicomputers; performance modeling; virtual channels; wormhole-routed k-ary n-cubes; Adaptive systems; Analytical models; Bandwidth; Computer Society; Delay; Hypercubes; Multiprocessor interconnection networks; Network topology; Routing; System recovery;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.817384

Filename

817384