DocumentCode :
327284
Title :
An analytical model of Duato´s fully-adaptive routing algorithm in k-ary n-cubes
Author :
Ould-Khaoua
Author_Institution :
Dept. of Comput. Sci., Strathclyde Univ., Glasgow, UK
fYear :
1998
fDate :
10-14 Aug 1998
Firstpage :
106
Lastpage :
113
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 has been hardly any study that describes analytical models for these algorithms. The paper proposes a queueing model for obtaining latency measures in wormhole-routed k-ary n-cubes with fully-adaptive routing, based on Duato´s (1993) algorithm. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments
Keywords :
deterministic algorithms; distributed memory systems; multiprocessor interconnection networks; network routing; virtual machines; analytical model; deterministic routing; fully-adaptive routing; fully-adaptive routing algorithm; latency measures; queueing model; simulation experiments; wormhole-routed k-ary n-cubes; Analytical models; Bandwidth; Computer science; Costs; Delay; Hardware; Hypercubes; Routing; System recovery; Topology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing, 1998. Proceedings. 1998 International Conference on
Conference_Location :
Minneapolis, MN
ISSN :
0190-3918
Print_ISBN :
0-8186-8650-2
Type :
conf
DOI :
10.1109/ICPP.1998.708469
Filename :
708469
Link To Document :
بازگشت