The hierarchical dual-net (HDN) was introduced as a topology of interconnection networks for extremely large parallel computers. The HDN is constructed based on a symmetric product graph (base network). A k-level hierarchical dual-net, HDN(B, k, S), contains (2N0) 2 k /(2 × k i=1 si) nodes, where S = {G ′ 1 , G ′ 2 ,. .. , G ′ k }, G ′ i is a super-node and si = |G ′ i | is the number of nodes in the super-node at the level i for 1 ≤ i ≤ k, and N0 is the number of nodes in the base network B. The node degree of HDN(B, k, S) is d0 + k, where d0 is the node degree of the base network. The HDN is node and edge symmetric and can contain huge number of nodes with small node-degree and short diameter. Disjoint-path routing is a fundamental and critical issue for the performance of an interconnection network. In this paper, we propose an efficient algorithm for finding disjoint-paths on an HDN and give the performance simulation results.
The hierarchical dual-net (HDN) is an interconnection network for building ultra-scale parallel systems. The HDN is constructed based on a symmetric product graph (called base network), such as three-dimensional torus and n-dimensional hypercubes. A k-level hierarchical dual-net, HDN(B, k, S), is obtained by applying k-time dual constructions on the base network B. S defines a super-node set that adjusts the scale of the system. The node degree of an HDN(B, k, S) is d0 + k where d0 is the node degree of B. The HDN is node and edge symmetric and can contain huge number of nodes with small node degree and short diameter. In this paper, we propose two efficient algorithms for finding a fault-free path on HDN. The first algorithm can always find a fault-free path in O(2 k F (B)) time if the number of faulty nodes on HDN is less than d0 + k, where F (B) is the time complexity of fault-tolerant routing in the base network. The second algorithm, more practical one, can find a fault-free path on HDN with arbitrary number of faulty nodes. The simulation results show that the second algorithm can find a fault-free path at high probability.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.