By Topic

An analytical model of fully-adaptive wormhole-routed k-ary n-cubes in the presence of hot spot traffic

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sarbazi-Azad, H. ; Dept. of Comput. Sci., Glasgow Univ., UK ; Ould-Khaoua, M. ; Mackenzie, L.M.

Several analytical models of fully-adaptive routing have recently been proposed for wormhole-routed k-ary n-cubes under the uniform traffic pattern. However, there has been hardly any model reported yet that deals with other important non-uniform traffic patterns, such as hot spots. As a result, most studies have resorted to simulation when evaluating the performance merits of adaptive routing. This paper describes the first analytical model of fully-adaptive wormhole routing in k-ary n-cubes in the presence of hot spot traffic. Results from simulation show close agreement with those predicted by the model

Published in:

Parallel and Distributed Processing Symposium, 2000. IPDPS 2000. Proceedings. 14th International

Date of Conference:

2000