# An Efficient Routing Algorithm for Mesh-Hypercube (M-H) Networks

@inproceedings{Rizvi2008AnER, title={An Efficient Routing Algorithm for Mesh-Hypercube (M-H) Networks}, author={Syed Sajjad Rizvi and Khaled M. Elleithy and Aasia Riasat}, booktitle={PDPTA}, year={2008} }

This paper presents an efficient routing algorithm for the Mesh-Hypercube (M-H) network. The M-H network is one of the new interconnection networking techniques use to build high performance parallel computers. The combination of M-H networks offers high connectivity among multiple nodes, fault-tolerance, and load scalability. However, the performance of M-H networks may degrade significantly in the presence of frequent link or node failures. When a link or node failure occurs, neither the…

## 2 Citations

An Alternative Routing Algorithm for Hex-Cell Network

- Computer Science, Business
- 2011

This paper proposes a new routing algorithm for Hex-Cell network based on a new addressing mode which utilises the addresses of the two neighbours’ cells of each source and destination nodes.

Multilayer Hex-Cells: A New Class of Hex-Cell Interconnection Networks for Massively Parallel Systems

- Computer ScienceInt. J. Commun. Netw. Syst. Sci.
- 2011

An interesting feature of the proposed Multilayer Hex-Cell is that it maintains a constant network degree regardless of the increase in the network size degree which facilitates modularity in building blocks of scalable systems.

## References

SHOWING 1-10 OF 17 REFERENCES

An optical multi-mesh hypercube: a scalable optical interconnection network for massively parallel computing

- Computer Science, Physics
- 1994

This paper presents the OMMH topology, analyzes its architectural properties and potentials for massively parallel computing, and compares it to the hypercube, and presents a three-dimensional optical design methodology based on free-space optics.

Hard-Potato routing

- Computer ScienceSTOC '00
- 2000

We present the first hot-potato routing algorithm for the n x n mesh whose running time on any "hard" (i.e., f~(n)) "many-to-one" batch routing problem is, with high probability, within a…

Varietal hypercube-a new interconnection network topology for large scale multicomputer

- Computer ScienceProceedings of 1994 International Conference on Parallel and Distributed Systems
- 1994

A new interconnection network topology, called varietal hypercube for large scale multicomputer systems, is proposed, which has most of the desirable properties of the hypercube, including recursive structure, partionability, strong connectivity, and the ability to embed other architectures such as ring and mesh.

Synchronizing Hypercube Networks in the Presence of Faults

- Computer ScienceIEEE Trans. Computers
- 1994

A new hardware method developed to synchronize hypercube networks that can sustain one fault and tolerate up to m/spl ges/2 Byzantine faults as long as the connectivity of the hypercube, n, is greater than max{2m+1,3m-2).

Tight bounds for oblivious routing in the hypercube

- Computer Science, MathematicsMathematical systems theory
- 2005

We prove that in anyN-node communication network with maximum degreed, any deterministic oblivious algorithm for routing an arbitrary permutation requires Ω(√N/d) parallel communication steps in the…

Broadcast communication delay metric for the iPSC/2 and iPSC/860 hypercubes

- Computer ScienceACM Southeast Regional Conference
- 1992

This work measures the performance of multicast communication on the Intel i PSC/2 and iPSC/860 hypercubes and derives equations modelling the cost of broadcast communication.

Probability and Computing: Randomized Algorithms and Probabilistic Analysis

- Mathematics, Computer Science
- 2005

Preface 1. Events and probability 2. Discrete random variables and expectation 3. Moments and deviations 4. Chernoff bounds 5. Balls, bins and random graphs 6. The probabilistic method 7. Markov…

Randomized Algorithms

- Computer Science, Mathematics
- 2000

These notes describe other important illustrations of randomized algo rithms in other areas of the theory of algorithms and describe some basic principles which typically underly the construction of randomized algorithms.

A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms

- Computer Science
- 2007

The construction for shortsighted abounded column-wise algorithms is illustrated with a simple model based on the model developed in [Bouchut-Boyaval, M3AS].

Communications Benchmarks for the iPSC/2", Hypercube and Distributed Computers

- Elsevier Science Publishers B.V., North-Holland,
- 1989