Analysis of a composite performance reliability measure for fault-tolerant systems
Journal of the ACM (JACM)
Performance Measures for Multiprocessor Controllers
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
Diagnostic And Computational Reconfiguration In Multiprocessor Systems
ACM '78 Proceedings of the 1978 annual conference
Optimal Dynamic Control of Resources in a Distributed System
IEEE Transactions on Software Engineering
A case for reconfigurable parallel architectures for information retrieval
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Determining Redundancy Levels for Fault Tolerant Real-Time Systems
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Surviving Errors in Component-Based Software
EUROMICRO '05 Proceedings of the 31st EUROMICRO Conference on Software Engineering and Advanced Applications
Design patterns for graceful degradation
Transactions on Pattern Languages of Programming I
| Hi-index | 0.00 |
A new quantitative approach to the problem of reconfiguring a degradable multimodule system is presented. The approach is concerned with both assigning some modules for computation and arranging others for reliability. Conventionally, a fault-tolerant system performs reconfiguration only upon a subsystem failure. Since there exists an inherent trade-off between the computation capacity and fault tolerance of a multimodule computing system, the conventional approach is a passive action and does not yield a configuration that provides an optimal compromise for the trade-off. By using the expected total reward as the optimal criterion, the need and existence of an active reconfiguration strategy, in which the system reconfigures itself on the basis of not only the occurrence of a failure but also the progression of the mission, are shown.Following the problem formulation, some important properties of an optimal reconfiguration strategy, which specify (i) the times at which the system should undergo reconfiguration and (ii) the configurations to which the system should change, are investigated. Then, the optimal reconfiguration problem is converted to integer nonlinear knapsack and fractional programming problems. The algorithms for solving these problems and a demonstrative example are given. Extensions of the optimal reconfiguration problem are also discussed.