Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes

@inproceedings{Bossard2010FaultTolerantND,
  title={Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes},
  author={Antoine Bossard and Keiichi Kaneko and Shietung Peng},
  booktitle={ICA3PP},
  year={2010}
}
Hypercube-based interconnection networks are one of the most popular network topologies when dealing with parallel systems. In a hypercube of dimension n, node addresses are made of n bits, and two nodes are adjacent if and only if their Hamming distance is equal to 1. In this paper we introduce a fault-tolerant hypercube routing algorithm which constructs n minus the number of faulty nodes f disjoint paths connecting one source node to k = n−f destination nodes in O(n) time complexity. 

From This Paper

Figures, tables, and topics from this paper.
4 Citations
12 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Node-to-set Disjoint Paths Problem in Perfect Hierarchical Hypercubes

  • A. Bossard, K. Kaneko, S. Peng
  • Proceedings of the 9th Parallel and Distributed…
  • 2010
1 Excerpt

Roadrunner: Science, Cell and a Petaflop/s

  • A. White, Grice, D. IBM
  • International Supercomputing Conference
  • 2008
1 Excerpt

Workload of an ipsc/860

  • B. Vanvoorst, S. Seidel, E. Barscz
  • Proc. Scalable High-Performance Computing Conf…
  • 1994
1 Excerpt

Similar Papers

Loading similar papers…