Abstract Imperfect coverage and nonnegligible reconfiguration delay are known to have a deleterious effect on the dependability and the performance of a multiprocessor system. In particular, increasing the number of processor elements does not always increase dependability. An obvious reason for this is that the total failure rate increases, generally, linearly with the number of components in the system. It is also a well-known fact that the performance gain due to parallelism mostly turns out to be sublinear with the number of processors. It is therefore important to optimize the degree of parallelism in system design. A related issue is that by deferring repair, it is sometimes possible to improve system dependability. In this case decisions have to be made dynamically as to when to repair and when not to repair. Most of the current research deals with static optimization of the number of processors. No systematic approach for dynamic control of dependable systems has been proposed so far. Dynamic, i.e. transient, decision of whether or not to repair is the optimization problem considered in this paper. We propose extended Markov reward models (EMRM) to capture such questions. EMRM are a marriage between performability modeling techniques and Markov decision theory. A numerical solution procedure is developed to provide optimal solution trajectories for this problem. EMRM are a general framework for the dynamic optimization of reconfigurable, dependable systems. The optimization is applied on the basis of several performance and dependability measures. In particular, we explore availability, capacity-oriented availability, performance-oriented unavailability, and performability measures. Furthermore, off-line and on-line repair strategies are compared. We show that guarded repair can improve system performance and dependability significantly. The control strategies and reward functions differ a lot in each case. Each scenario turns out to be interest in its own right. A time-dependent optimality of dependable, parallel configurations can be determined from our results.
[1]
H. D. Meer,et al.
A Modeling Approach for Dynamically Reconfigurable Systems
,
1993
.
[2]
Carl M. Harris,et al.
Fundamentals of queueing theory
,
1975
.
[3]
Douglas M. Blough,et al.
Incorporating Recovery in Performability Models for Multi-Computer Systems
,
1993,
MASCOTS.
[4]
Victor F. Nicola,et al.
Limits of Parallelism in Fault-Tolerant Multiprocessors
,
1992
.
[5]
Kishor S. Trivedi,et al.
Should I add a processor? (performance evaluation)
,
1990,
Twenty-Third Annual Hawaii International Conference on System Sciences.
[6]
Marco Ajmone Marsan,et al.
A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems
,
1984,
TOCS.
[7]
M. D. Beaudry,et al.
Performance-Related Reliability Measures for Computing Systems
,
1978,
IEEE Transactions on Computers.
[8]
Onno Boxma,et al.
Sojourn times in queueing networks
,
1989
.
[9]
John F. Meyer,et al.
On Evaluating the Performability of Degradable Computing Systems
,
1980,
IEEE Transactions on Computers.
[10]
W. C. Carter,et al.
Reliability modeling techniques for self-repairing computer systems
,
1969,
ACM '69.
[11]
R. Bellman.
Dynamic programming.
,
1957,
Science.
[12]
Thomas F. Arnold,et al.
The Concept of Coverage and Its Effect on the Reliability Model of a Repairable System
,
1973,
IEEE Transactions on Computers.
[13]
Jean-Luc Gaudiot,et al.
Limits on scalability in gracefully degradable large-scale systems
,
1989,
Proceedings of the Eighth Symposium on Reliable Distributed Systems.