Browsing by Author "Hou, YM"

Now showing 1 - 2 of 2

Adaptive path-based multicast on wormhole-routed hypercubes
(2002)
Wang, CM
;
Hou, YM
;
Hsu, LH
;
資訊工程學系
;
Department of Computer Science
In this paper, we consider path-based multicast on wormhole-routed hypercubes. A minimum set of routing restrictions is used as the base routing algorithm. To correctly perform multicast, we present the natural list to sort the destination nodes. It can be proved to be deadlock-free for both one-port and multi-port systems. Furthermore, it creates only one worm for each multicast. Between each pair of nodes in a multicast path with distance k, on the average, there are at least (k+1)!/2(k) adaptive shortest paths, which is superior to previous works. We also propose a heuristic algorithm to reduce the path length. The simulation result shows that its sustainable throughput is much better than related works. In addition, unicast and broadcast can be treated as degenerated cases and use the same routing algorithm. Therefore, it offers a comprehensive routing solution for communication on hypercubes.
Broadcasting on wormhole-routed 2D tori with arbitrary size
(1998)
Hou, YM
;
Wang, CM
;
Tsai, MJ
;
Hsu, LH
;
資訊工程學系
For distributed memory parallel computers, broadcast operations are widely used in a variety of applications. In this paper, we propose an efficient algorithm for broadcasting on an all-port wormhole-routed 2D tents with arbitrary size. The underlying network is assumed to support only the dimension-ordered unicast. By taking the advantage of the all-port model and the distance insensitivity of the wormhole routing, the proposed algorithm can greatly reduce the number of message-passing steps. In addition, it can be proved to be depth contention-free. The performance study in this paper clearly shows the advantage of the proposed algorithm.