A deadlock-free routing for hierarchical interconnection network: TESH
A deadlock-free routing for hierarchical interconnection network: TESH
复制标题
一种分层互连网络的无死锁路由:TESH
DOI:
10.1109/hpc.2000.846532
复制
发表时间:
2000
期刊:
影响因子:
--
通讯作者:
Susumu Horiguchi
中科院分区:
文献类型:
--
作者:
Yasuyuki Miura;Susumu Horiguchi
A hierarchical interconnection network, TESH (Tori connected mESHes) allows exploitation of computational locality as well as modular future expansion. To implement a worm-hole routing on TESH, an appropriate method is required to allocate virtual channels on a basic module, since the number of virtual channels depends on allocation policy of inter-BM links. The paper addresses a link allocation policy that minimizes the network diameter and the number of virtual channels. Dynamic communication performances are simulated for TESH and mesh networks. It is seen that the dynamic communication performance of TESH is better than mesh interconnection.