Abstract
An important aspect which is often overlooked in the software design cycle is the question of reliability. Many methodologies in the past have attempted to provide reliability efficiently but have never been successful at eliminating explicit time and space redundancy. The approach taken here is based on the Application-Oriented Fault Tolerance Paradigm which provides reliability by examining the behavior and properties of the application. This paper will demonstrate how fault detecting constraints are developed and incorporated using the Application-Oriented Fault Tolerance paradigm for the class of Branch and Bound algorithms. Branch and bound algorithms are a type of combinatorial search strategy which minimize the search space by means of an optimization function. This algorithm is implemented in parallel on a distributed machine providing fault tolerance as well as convenience in fault reconfiguration and recovery.
Recommended Citation
Sun, Aggie and McMillin, Bruce M., "Application-Oriented Fault-Tolerant Parallel Branch & Bound" (1991). Computer Science Technical Reports. 107.
https://scholarsmine.mst.edu/comsci_techreports/107
Department(s)
Computer Science
Report Number
CSc-91-14
Document Type
Technical Report
Document Version
Final Version
File Type
text
Language(s)
English
Rights
© 1991 University of Missouri - Rolla, All rights reserved
Publication Date
6 August 1991
Comments
This work was supported in part by the National Science Foundation under Grant Numbers MIP-8909749 and CDA-8820714, and in part by the AMOCO Faculty Development Program.