Comparative analytical performance evaluation of adaptivity in wormhole-switched hypercubes

In this paper, we study the effect of adaptivity of the routing algorithm on the overall performance of 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 the hypercube. We compare these three different classes of routing algorithms under different working conditions and structural factors. It is widely believed that the level of adaptivity can result in better performance. Our analysis shows that under uniform traffic load, the employed partially-adaptive routing algorithm exhibits a lower performance compared to the considered deterministic routing algorithm.