Proceedings 1997 International Conference on Parallel Architectures and Compilation Techniques (1997)
San Francisco, CA
Nov. 11, 1997 to Nov. 15, 1997
D.R. Miller , Dept. of Comput. Sci., Colorado State Univ., Fort Collins, CO, USA
W.A. Najjar , Dept. of Comput. Sci., Colorado State Univ., Fort Collins, CO, USA
This paper addresses the issue of how router complexity affects the overall performance in deterministic and adaptive routing under virtual cut-through switching in k-ary n-cube networks. First, the performance of various adaptive routers with constant area are compared. Second, the performance of adaptive and deterministic routers are compared under the same conditions. Finally, it is shown that, under certain conditions, deterministic routers can reach saturation points comparable to adaptive routers.
hypercube networks; deterministic routing; adaptive routing; constant-area routers; router complexity; performance; virtual cut-through switching; k-ary n-cube networks; saturation points; hypercube networks
W. Najjar and D. Miller, "Empirical Evaluation Of Deterministic And Adaptive Routing With Constant-Area Routers," Proceedings 1997 International Conference on Parallel Architectures and Compilation Techniques(PACT), San Francisco, CA, 1997, pp. 64.