Adaptive routing algorithms and implementation for interconnection network TESH for parallel processing

Yasuyuki Miura, Masahiro Kaneko, Shigeyoshi Watanabe

Abstract: We introduce three adaptive routing algorithms for the hierarchical interconnection network TESH (tori-connected meshes) and evaluate their hardware costs and delays. TESH, which consists of a hierarchical torus interconnection between meshes as a basic module, is one of the k-ary n-cube networks, for which many adaptive routing algorithms have already been proposed. Adaptive routings for TESH have also been proposed in previous work.