• DocumentCode
    3553917
  • Title

    Fault-tolerant parallel algorithms

  • Author

    Fernandez, Eduardo B. ; Fernandez, Minjie H.

  • Author_Institution
    Dept. of Comput. Eng., Florida Atlantic Univ., Boca Raton, FL, USA
  • fYear
    1991
  • fDate
    7-10 Apr 1991
  • Firstpage
    466
  • Abstract
    Fault-tolerant software approaches require the users to writer N versions of the algorithm which should be as different as possible to avoid correlated errors (where all or most versions fail with the same input value). The degree of difference is known as the diversity level of the versions. A new way to improve diversity is proposed. It consists of taking advantage of the higher degree of freedom provided by parallel implementations of an algorithm. Many paradigms for parallel algorithms have been developed, including divide-and-conquer, pipelined/systolic, graph function, and compute-aggregate-broadcast. By writing an algorithm using different parallel paradigms its diversity level can be increased. Software metrics can be used to quantify this level of difference
  • Keywords
    fault tolerant computing; parallel algorithms; parallel programming; software metrics; compute-aggregate-broadcast; correlated errors; degree of difference; diversity level; divide-and-conquer; fault tolerant computing; graph function; parallel algorithms; parallel implementations; pipelined processing; software metrics; systolic processing; Broadcasting; Computer errors; Fault tolerance; Fires; Object oriented modeling; Parallel algorithms; Petri nets; Software algorithms; Testing; Writing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Southeastcon '91., IEEE Proceedings of
  • Conference_Location
    Williamsburg, VA
  • Print_ISBN
    0-7803-0033-5
  • Type

    conf

  • DOI
    10.1109/SECON.1991.147797
  • Filename
    147797