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.
|Title of host publication||Proceedings of the International Parallel Processing Symposium, IPPS|
|Number of pages||6|
|Publication status||Published - 2000|
ASJC Scopus subject areas
- Hardware and Architecture