The HCN: a versatile interconnection network based on cubes

Ghose, Kanad; Desai, Kiran

doi:10.1145/76263.76310

Cited by 35 publications

(16 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As such, they usually involve a mix of concepts relating to different existing interconnection networks. For example: in [6] the two-level binary hypercubebased hierarchical interconnection network is defined where there are 2 D collections of d-dimensional hypercubes with unique vertices in each hypercube forming a set of vertices that are interconnected as a D-dimensional hypercube; in [11] the hierarchical cubic network is defined where 2 n n-dimensional hypercubes are joined so that each vertex in an n-dimensional hypercube is joined to exactly one vertex from some other n-dimensional hypercube; and in [15] the hierarchical crossed cube HCC(k, n) was studied where 2 k+n copies of an n-dimensional crossed cube are joined in the 'shape' of various k-dimensional hypercubes. Hierarchical interconnection networks hold much promise as the systematic composition of various networks can often yield new interconnection networks with attractive properties.…”

Section: Discussionmentioning

confidence: 99%

Multiswapped networks and their topological and algorithmic properties

Stewart¹

2013

Journal of Computer and System Sciences

View full text Add to dashboard Cite

Section: Discussionmentioning

confidence: 99%

Multiswapped networks and their topological and algorithmic properties

Stewart¹

2013

Journal of Computer and System Sciences

View full text Add to dashboard Cite

“…Not only are hypercubes popular as interconnection network on their own, but they are also very popular as seed for advanced network topologies such as those employed by hierarchical interconnection networks (HINs). Hierarchical hypercubes [4,5,6,7], hierarchical cubic networks [8,9,10], metacubes [11,12], dual-cubes [13,14] are some examples.…”

Section: Introductionmentioning

confidence: 99%

Hypercube Fault Tolerant Routing with Bit Constraint

Bossard

Kaneko

2015

IJNC

View full text Add to dashboard Cite

Thanks to its simple definition, the hypercube topology is very popular as interconnection network of parallel systems. There have been several routing algorithms described for the hypercube topology, yet in this paper we focus on hypercube routing extended with an additional restriction: bit constraint. Concretely, path selection is performed on a particular subset of nodes: the nodes are required to satisfy a condition regarding their bit weights (a.k.a. Hamming weights). There are several applications to such restricted routing, including simplification of disjoint paths routing. We propose in this paper two hypercube routing algorithms enforcing such node restriction: first, a shortest path routing algorithm, second a fault tolerant point-topoint routing algorithm. Formal proof of correctness and complexity analysis for the described algorithms are conducted. We show that the shortest path routing algorithm proposed is time optimal. Finally, we perform an empirical evaluation of the proposed fault tolerant point-topoint routing algorithm so as to inspect its practical behaviour. Along with this experimentation, we analyse further the average performance of the proposed algorithm by discussing the average Hamming distance in a hypercube when satisfying a bit constraint.

show abstract

“…Additionally, one should note that hypercubes are very popular as seed (i.e. sub-network) of more complex interconnection network topologies, especially those for hierarchical interconnection networks (HINs) with examples such as dual-cubes 4 , metacubes 5 , hierarchical hypercubes 6 and hierarchical cubic networks 7 .…”

Section: Introductionmentioning

confidence: 99%

A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint

Bossard¹,

Kaneko²

2015

IJNDC

View full text Add to dashboard Cite

As reflected by the TOP500 list, hypercubes are popular interconnection networks for massively parallel systems, the main reason being the simplicity and ease of implementation of this network topology. In order to retain performance high and avoid bottleneck situation, routing algorithms are critical for these high-performance systems. Furthermore, disjoint path routing is a very desirable property of such communication algorithms. Effectively, selecting mutually node-disjoint paths guarantees that notorious parallel processing issues such as deadlocks, livelocks and starvations shall never occur. In this paper, we describe a routing algorithm for hypercubes that, given a bit constraint, selects internally node-disjoint paths between any pair of nodes satisfying the constraint, and such that the selected paths all satisfy the constraint. The introduction of such bit constraint enables the selection of multiple sets of disjoint paths between several node pairs each satisfying a distinct bit constraint, which is impossible with conventional routing algorithms. Selecting simultaneously disjoint paths between different node pairs induces increased communication performance and system dependability. The correctness and complexities of the described algorithm are formally proved, and analysis of the algorithm performance in practice is conducted by empirical evaluation.

show abstract

The HCN: a versatile interconnection network based on cubes

Cited by 35 publications

References 10 publications

Multiswapped networks and their topological and algorithmic properties

Multiswapped networks and their topological and algorithmic properties

Hypercube Fault Tolerant Routing with Bit Constraint

A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint

Contact Info

Product

Resources

About