Dual-tree-based multicasting on wormhole-routed irregular switch-based networks
Recently, network of workstations (NOWs) is emerging as an inexpensive alternative to massively parallel processors (MPPs). The irregular switch-based networks are proposed to build NOWs for high performance parallel computing. In this paper, we address a dual-tree-based routing model and propose an efficient dual-tree-based multicasting algorithm with optimum level-based destination-switch partition strategy on irregular switch-based networks. The dual-tree-based routing scheme supports adaptive, distributed, and deadlock-free multicast on switch-based networks with double channels. We first describe a dual-tree structure established, based on the concept of network partitioning, from the irregular networks and prove that the multicasting based on this structure is deadlock-free. Then, an efficient multicast routing algorithm with optimum level-based partition strategy is proposed. Finally, the experimental results are given to show that the multicast performance based on tree-based multicasting scheme can be promoted by the dual-tree-based multicasting scheme with optimum level-based destination-switch partition strategy.
multicast switch-based networks deadlock-free virtual channels wormhole routing