• DocumentCode
    2135404
  • Title

    Fault-tolerant multiple bus networks for fan-in algorithms

  • Author

    Vaidyanathan, Ramachandran ; Nadella, Sudharani

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA
  • fYear
    1996
  • fDate
    15-19 Apr 1996
  • Firstpage
    674
  • Lastpage
    681
  • Abstract
    We consider a large class of algorithms called “fan-in algorithms” that are useful for problems involving semi-group operations. This paper deals with the design of fault-tolerant multiple bus networks (MBNs) suited to run fan-in algorithms. We present two methods for constructing fan-in MBNs with tolerance to bus faults, that have nearly optimal performance and processor fan-out. We also present a general framework that converts any fan-in MBN (including those resilient to bus faults) into one with tolerance to processor faults, and for which faulty processors slow the original algorithm (for fault-free processors) by only one step
  • Keywords
    fault tolerant computing; multiprocessor interconnection networks; parallel algorithms; parallel architectures; performance evaluation; system buses; bus faults; fan-in algorithms; fault-free processors; multiple bus network fault tolerance; multiprocessor interconnection networks; optimal performance; processor fan-out; processor fault tolerance; semigroup operations; Algorithm design and analysis; Communications technology; Costs; Fault tolerance; Hypercubes; Multiprocessor interconnection networks; NP-hard problem; Optical fiber communication; Polynomials; Topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International
  • Conference_Location
    Honolulu, HI
  • Print_ISBN
    0-8186-7255-2
  • Type

    conf

  • DOI
    10.1109/IPPS.1996.508130
  • Filename
    508130