웜홀 라우팅을 사용한 토러스 네트워크에서 무교착 멀티캐스트 알고리즘

초록

Multicast communication, in which the same message is delivered from a source node to an arbitary number of destination nodes, is being increasingly demanded in paralled computing. System supported multicast services can potentially offer improved preformance, increased functionality, and simplified programming, and may in turn be used to support various higher-level operations for data movement and global process control. In this paper, two multicast wormhole routing strategies for torus multicomputers are proposed and studied. Ths proposed algorithms, which use virtual channels, are shown to be deadlock-free. A simulation study has been conducted to compare the performance of these multicast algorithms under random network traffic conditions in a torus. Performance results of these two algorithms are compared with the tree-based and the optimal partition algorithms.