Analytical Performance Comparison of Deterministic, Partially- and Fully-Adaptive Routing Algorithms in Binary n-Cubes

Authors:
A. Patooghy;H. Sarbazi-Azad
Affiliations:
IPM School of Computer Science, Iran;IPM School of Computer Science, Iran
Venue:
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 2
Year:
2006

Citing 4
Cited 0

The turn model for adaptive routing

ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
A comprehensive analytical model for wormhole routing in multicomputer systems

Journal of Parallel and Distributed Computing
An accurate analytical model of adaptive wormhole routing in k-ary n-cubes interconnection networks

Performance Evaluation
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the effect of adaptivity of routing algorithm on the overall performance in a hypercube multicomputer using wormhole switching. To this end, we use three accurate analytical models proposed for deterministic, fully-adaptive, and partially-adaptive routing algorithms in hypercube. Surprisingly, our analysis shows that under uniform traffic load, the partially-adaptive routing exhibits a lower performance compared to the deterministic routing with less adaptivity.