Efficient multi-dimensional grids reconfiguration algorithm on hypercubes.

S. K. Chen, C. T. Liang, W. T. Tsai

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

8 Scopus citations

Abstract

Reconfiguration algorithms are invoked when a fault is detected in the original loop or multidimensional grid. The reconfiguration algorithms are able to reach an equivalent set of topologies within the same architecture in a distributed manner. The authors propose mapping schemes for certain length of loops so that the resulting systems can recover from any fault within one step. With application of one of the schemes, the reconfiguration strategy for a multidimensional grid system can have better performance.

Original languageEnglish (US)
Title of host publicationDigest of Papers - FTCS (Fault-Tolerant Computing Symposium)
PublisherPubl by IEEE
Pages368-373
Number of pages6
ISBN (Print)0818608676
StatePublished - Dec 1 1988

Publication series

NameDigest of Papers - FTCS (Fault-Tolerant Computing Symposium)
ISSN (Print)0731-3071

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Efficient multi-dimensional grids reconfiguration algorithm on hypercubes.'. Together they form a unique fingerprint.

  • Cite this

    Chen, S. K., Liang, C. T., & Tsai, W. T. (1988). Efficient multi-dimensional grids reconfiguration algorithm on hypercubes. In Digest of Papers - FTCS (Fault-Tolerant Computing Symposium) (pp. 368-373). (Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)). Publ by IEEE.