• DocumentCode
    2696266
  • Title

    Fault tolerant routing in toroidal networks

  • Author

    Gu, Qian-Ping ; Peng, Shietung

  • Author_Institution
    Dept. of Comput. Software, Aizu Univ., Japan
  • fYear
    1995
  • fDate
    15-17 Mar 1995
  • Firstpage
    162
  • Lastpage
    168
  • Abstract
    We give an O(r2) time algorithm for constructing a fault-free routing path of optimal length between any true non-fault nodes of an r-dimensional torus with 2r-1 faulty nodes. We show that the Rabin diameter of a r-dimensional torus is its diameter plus one. We also describe a cluster fault tolerant (CFT) routing model and give an efficient algorithm for node-to-node CFT routing
  • Keywords
    computational complexity; fault tolerant computing; multiprocessor interconnection networks; parallel algorithms; O(r2) time algorithm; Rabin diameter; cluster fault tolerant routing model; fault tolerant routing; fault-free routing path; node-to-node cluster fault tolerant routing; r-dimensional torus; toroidal networks; true nonfault nodes; Clustering algorithms; Fault tolerance; Intelligent networks; Joining processes; Multiprocessing systems; Multiprocessor interconnection networks; Polynomials; Routing; Software algorithms; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Algorithms/Architecture Synthesis, 1995. Proceedings., First Aizu International Symposium on
  • Conference_Location
    Fukushima
  • Print_ISBN
    0-8186-7038-X
  • Type

    conf

  • DOI
    10.1109/AISPAS.1995.401342
  • Filename
    401342
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2696266