Browsing by Author "Chiang, WK"

Now showing 1 - 4 of 4

Block-switch networks: A cost-effective class of interconnection network
(1997-05-01)
Chiang, WK
;
Chen, RJ
;
資訊工程學系
;
Department of Computer Science
A new interconnection scheme is proposed for hierarchically constructing massively parallel systems, called the Block-Switch Network (BSN). Presented here is method of connecting together a number of identical basic atoms level by level, a basic atom being an arbitrary connected graph. A BSN is characterized by (G, m), where G represents the basic atom and m denotes the number of levels in hierarchical expansion. A particular choice for G yields a family of hierarchical networks. The topological properties of the BSN for the general case are investigated, and then the results gained from applying BSN to different basic atoms are also discussed. The BSN enables us to construct new families of graphs more feasible and cost-effective. It also deserves mentioning that a shortest-path routing algorithm for the BSN is derived by reducing the routing problem to the K-best perfect matching problem. In particular, we implement fundamental parallel algorithms (descend/ascend) on the BSN(Q(n), m) where Q(n) denotes an n-cube, and demonstrate that the performance on the BSN(Q(n),m) is very close to that of the comparable hypercube.
Block-switch networks: A cost-effective class of interconnection network
(1997-05-01)
Chiang, WK
;
Chen, RJ
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
A new interconnection scheme is proposed for hierarchically constructing massively parallel systems, called the Block-Switch Network (BSN). Presented here is method of connecting together a number of identical basic atoms level by level, a basic atom being an arbitrary connected graph. A BSN is characterized by (G, m), where G represents the basic atom and m denotes the number of levels in hierarchical expansion. A particular choice for G yields a family of hierarchical networks. The topological properties of the BSN for the general case are investigated, and then the results gained from applying BSN to different basic atoms are also discussed. The BSN enables us to construct new families of graphs more feasible and cost-effective. It also deserves mentioning that a shortest-path routing algorithm for the BSN is derived by reducing the routing problem to the K-best perfect matching problem. In particular, we implement fundamental parallel algorithms (descend/ascend) on the BSN(Q(n), m) where Q(n) denotes an n-cube, and demonstrate that the performance on the BSN(Q(n),m) is very close to that of the comparable hypercube.
On the arrangement graph
(1998-05-29)
Chiang, WK
;
Chen, RJ
;
資訊工程學系
;
Department of Computer Science
The arrangement graph was proposed as a generalization of the star graph topology. In this paper we investigate the topological properties of the (n, k)-arrangement graph A(n.k). It has been shown that the (n, n - 2)-arrangement graph A(n,n-2) is isomorphic to the n-alternating group graph AG,. In addition, the exact value of average distance of A(n,k) has been derived. (C) 1998 Published by Elsevier Science B.V. All rights reserved.
Topological properties of hierarchical cubic networks
(1996-11-10)
Chiang, WK
;
Chen, RJ
;
資訊工程學系
;
Department of Computer Science
The hierarchical cubic network (HCN), which takes hypercubes as basic clusters, was first introduced in [6]. Compared with the hypercube of the same size, the HCN requires only about half the number of links and provides a lower diameter. This paper first proposes a shortest-path routing algorithm and an optimal broadcasting algorithm for the HCN. We then show that the HCN is optimal fault tolerant by constructing node-disjoint paths between any two nodes, and demonstrate that the HCN is Hamiltonian. Moreover, it is shown that the average dilation for hypercube emulation on the HCN is bounded by 2. This result guarantees that all the algorithms designed for the hypercube can be executed on the HCN with a small degradation in time performance.