• DocumentCode
    2369970
  • Title

    Adaptive fault-tolerant wormhole routing algorithms with low virtual channel requirements

  • Author

    Chalasani, Suresh ; Boppana, Rajendra V.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Wisconsin Univ., Madison, WI, USA
  • fYear
    1994
  • fDate
    14-16 Dec 1994
  • Firstpage
    214
  • Lastpage
    221
  • Abstract
    We present simple methods to enhance a recently proposed class of fully adaptive algorithms for fault tolerant wormhole routing. These algorithms are based on J. Duato´s (1993) theory and are being used in several research projects. We show that with three virtual channels per physical channel, multiple rectangular shaped fault blocks can be tolerated in two dimensional meshes. There is no restriction on the number of faults, and maintaining fault information locally is sufficient. The logic for fault tolerant routing is used only in the presence of faults, and there is no performance degradation in the absence of faults. The proposed technique incorporates fault tolerance into wormhole algorithms with simple logic and low virtual channel requirements
  • Keywords
    adaptive systems; fault tolerant computing; hypercube networks; network routing; reliability; adaptive fault-tolerant wormhole routing algorithms; fault tolerant routing; fault tolerant wormhole routing; fully adaptive algorithms; low virtual channel requirements; multiple rectangular shaped fault blocks; simple logic; two dimensional meshes; virtual channels; Adaptive algorithm; Algorithm design and analysis; Computer networks; Computer science; Concurrent computing; Degradation; Fault tolerance; Logic; Routing; System recovery;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Architectures, Algorithms and Networks, 1994. (ISPAN), International Symposium on
  • Conference_Location
    Kanazawa
  • Print_ISBN
    0-8186-6507-6
  • Type

    conf

  • DOI
    10.1109/ISPAN.1994.367144
  • Filename
    367144