Loops and multi-dimensional grids on hypercubes: mapping and reconfiguration algorithms

Shyh Kwei Chen, Chung Ti Liang, Wei Tek Tsai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

Reconfiguration algorithms for loops and multidimensional grids in a hypercube architecture are studied. The reconfiguration algorithms are invoked when a fault is detected and the original loop or multidimensional grid is no longer valid. The reconfiguration algorithms are able to reach an equivalent set of topologies within the same architecture in a distributed manner. Fault-tolerant mapping strategies for embedding a loop or a multidimensional grid into a hypercube are also proposed so that the resulting mapping facilitates the reconfiguration.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel Processing
EditorsFaye A. Briggs, Howard E. Sturgis, David H. Bailey
PublisherPubl by IEEE
Pages315-322
Number of pages8
Volume1
StatePublished - 1988
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Chen, S. K., Liang, C. T., & Tsai, W. T. (1988). Loops and multi-dimensional grids on hypercubes: mapping and reconfiguration algorithms. In F. A. Briggs, H. E. Sturgis, & D. H. Bailey (Eds.), Proceedings of the International Conference on Parallel Processing (Vol. 1, pp. 315-322). Publ by IEEE.