By Topic

Fault-tolerant parallel algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fernandez, E.B. ; Dept. of Comput. Eng., Florida Atlantic Univ., Boca Raton, FL, USA ; Fernandez, M.H.

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

Published in:

Southeastcon '91., IEEE Proceedings of

Date of Conference:

7-10 Apr 1991