Hierarchical Dual-Net: A Flexible Interconnection Network and Its Routing Algorithm

Li, Yamin; Peng, Shietung; Chu, Wanming

doi:10.1109/icnc.2011.18

Cited by 8 publications

(9 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We begin with a brief introduction to the recursive dual-net (RDN) [6], the details of the RDN descriptions can be found in [6]. An RDN is constructed recursively by a dual-construction.…”

Section: The Hierarchical Dual-netmentioning

confidence: 99%

“…Given two nodes u and v in HDN(B, k, S), we first present a simple routing algorithm that finds a shortest path from u to v [6]. In Section II, we defined the product and quotient graphs.…”

Section: Routing On Hdnmentioning

confidence: 99%

“…In this paper, we first present a flexible interconnection network, called Hierarchical Dual-Net (HDN) [6]. The HDN is symmetric and can connect a large number of nodes with a small node degree, meanwhile keeping the diameter short.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Disjoint-Path Routing on Hierarchical Dual-Nets

Arai

2014

IJNC

Self Cite

View full text Add to dashboard Cite

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.

show abstract

“…We begin with a brief introduction to the recursive dual-net (RDN) [6], the details of the RDN descriptions can be found in [6]. An RDN is constructed recursively by a dual-construction.…”

Section: The Hierarchical Dual-netmentioning

confidence: 99%

“…Given two nodes u and v in HDN(B, k, S), we first present a simple routing algorithm that finds a shortest path from u to v [6]. In Section II, we defined the product and quotient graphs.…”

Section: Routing On Hdnmentioning

confidence: 99%

See 1 more Smart Citation

Disjoint-Path Routing on Hierarchical Dual-Nets

Arai

2014

IJNC

Self Cite

View full text Add to dashboard Cite

show abstract

“…One-Port, Multi-Ports and All-Ports [33]. This study use the All-Port router model where routers can send/receive multiple messages simultaneously to a neighboring node, and that node can simultaneously send/receive messages along all ejection and injection channels [34] and [35]. Broadcast problem can be applied by using a Hamilton path from source to destinations.…”

Section: Introductionmentioning

confidence: 99%

X-Hamiltonian Surface Broadcast Algorithm

El-Obaid¹

2016

IJCNS

View full text Add to dashboard Cite

Broadcast is one of the most important approach in distributed memory parallel computers that is used to find a routing approach from one source to all nodes in the mesh. Broadcasting is a data communication task in which corresponds to one-to-all communication. Routing schema is the approach used to determine the road that is used to send a message from a source node to destination nodes. In this paper, we propose an efficient algorithm for broadcasting on an all-port wormhole-routed 3D mesh with arbitrary size. Wormhole routing is a fundamental routing mechanism in modern parallel computers which is characterized with low communication latency. We show how to apply this approach to 3-D meshes. In wormhole, routing large network packets are broken into small pieces called FLITs (flow control digits). The destination address is kept in the first flit which is called the header flit and sets up the routing behavior for all subsequent flits associated with the packet. In this paper, we introduce an efficient algorithm, X-Hamiltonian Surface Broadcast (X-HSB) which uses broadcast communication facility with deadlock-free wormhole routing in general three dimensional networks. In this paper, the behaviors of this algorithm are compared to the previous results using simulation; our paradigm reduces broadcast latency and is simpler. The results presented in this paper indicate the advantage of our proposed algorithm.

show abstract

“…In this paper, we first present a flexible interconnection network, called Hierarchical Dual-Net (HDN) [8]. The HDN is symmetric and can connect a large number of nodes with a small node degree, meanwhile keeping the diameter short.…”

Section: Introductionmentioning

confidence: 99%

Total exchange routing on hierarchical dual-nets

Chu

2014

IJBDI

Self Cite

View full text Add to dashboard Cite

The hierarchical dual-net (HDN) is a newly proposed interconnection network for massive 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 n k = (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 S is used mainly for adjusting the scale of the system. 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. The total exchange is one of the most dense communication patterns and is at the heart of numerous applications and programming models in parallel computing. In this paper, we show that the total exchange routing can be done on HDN efficiently.

show abstract

Hierarchical Dual-Net: A Flexible Interconnection Network and Its Routing Algorithm

Cited by 8 publications

References 6 publications

Disjoint-Path Routing on Hierarchical Dual-Nets

Disjoint-Path Routing on Hierarchical Dual-Nets

X-Hamiltonian Surface Broadcast Algorithm

Total exchange routing on hierarchical dual-nets

Contact Info

Product

Resources

About