The hyper-deBruijn multiprocessor networks

Ganesan, Elaiyasuriyan; Pradhan, Dhiraj K.

doi:10.1109/icdcs.1991.148716

Cited by 9 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…in HD(m, n) as subgraph [21], CBT (1), where N (4 n+l 1) 3 (optimal) [26] optimal and modular embeddings of rings, meshes, hypercubes, complete binary trees, X-trees, hypertrees, tree machines, mesh of trees, and pyramids.…”

Section: Discussionmentioning

confidence: 99%

“…{x._ XolX Z2 for 0 <-<n 1 and the edge-set E. {{X._l... Xo, Xn--2 xop} p, x Zz, 0 <_ -< n 1 }. The order-(m, n) hyper-de Bruijn graph [21] is the product graph HD(m, n) Qm DG(n).…”

Section: / 2 D D + D 2 and R + /2 / "mentioning

confidence: 99%

“…Let us now compare the topological properties of HP, with several other hypercube-like networks (Table 1). For the facts stated in this table, refer to [1,25,21,19].…”

Section: Properties Of Hp Networkmentioning

confidence: 99%

See 2 more Smart Citations

Embeddings into Hyper Petersen Networks: Yet Another Hypercube-Like Interconnection Topology

1995

View full text Add to dashboard Cite

A new hypercube-like topology, called the hyper Petersen (HP) network, is proposed and analyzed, which is constructed from the well-known cartesian product of the binary hypercube and the Petersen graph of ten nodes.This topology is an attractive candidate for multiprocessor interconnection having such desirable properties as regularity, high symmetry and connectivity, and logarithmic diameter. For example, an n-dimensional hyper Petersen network, HPn, with N=1.25 * 2n nodes is a regular graph of degree and node-connectivity n and diameter n–1 , whereas an (n–1)-dimensional binary hypercube, Qn−1 , with the same diameter covers only 2n−1 nodes, each of degree (n–1). Thus the HP topology accommodates 2.5 times extra nodes than Qn−1 at the cost of increasing the node-degree by one. With the same degree and connectivity of n, the diameter of the HPn network is one less than that of Qn, yet having 1.25 times larger number of nodes.Efficient routing and broadcasting schemes are presented, and node-disjoint paths in HPn, are computed even under faulty conditions. The versatility of the hyper Petersen networks is emphasized by embedding rings, meshes, hypercubes and several tree-related topologies into it. Contrary to the hypercubes, rings of odd lengths, and a complete binary tree of height n–1 permit subgraph embeddings in HPn.

show abstract

Section: Discussionmentioning

confidence: 99%

“…{x._ XolX Z2 for 0 <-<n 1 and the edge-set E. {{X._l... Xo, Xn--2 xop} p, x Zz, 0 <_ -< n 1 }. The order-(m, n) hyper-de Bruijn graph [21] is the product graph HD(m, n) Qm DG(n).…”

Section: / 2 D D + D 2 and R + /2 / "mentioning

confidence: 99%