Pii: S0166-5316(01)00037-2
نویسندگان
چکیده
In this paper, we address the problem of preventive maintenance of operational software systems, an approach recently proposed to counteract the phenomenon of software “aging”. We consider the so-called “software rejuvenation” technique [Software rejuvenation: analysis, module and applications, in: Proceedings of the 25th International Symposium on Fault-Tolerance Computing (FTCS-25), Pasadena, CA, USA, June 1995], which consists in periodically stopping the software system and then restarting it in a “robust” state after a proper maintenance, and we propose a methodology for the quantitative analysis of rejuvenation strategies. The methodology is based on a fine grained model that assumes that it is possible to identify the current degradation level of the system by monitoring an observable quantity, so that the rejuvenation strategy can be tuned on the measured degradation. Based on this methodology, we present two different strategies that allow to decide whether and when to rejuvenate, and we exploit the theory of renewal processes with reward to estimate the steady-state unavailability of the software system, which is used to define an optimality criterion that allows us to evaluate the proper rejuvenation intervals. The methodology and the rejuvenation strategies are demonstrated by applying them to a real-world case study, arising in the area of database maintenance for data archiving, and to a hypothetical setting used to assess the sensitivity of the technique to various degradation processes. © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Fine grained software degradation models for optimal rejuvenation policies
In this paper we address the problem of preventive maintenance of operational software systems, an approach recently proposed to counteract the phenomenon of software \aging". We consider the so-called \software rejuvenation" technique 13], which consists in periodically stopping the software system and then restarting it in a \robust" state after a proper maintenance, and we propose a methodol...
متن کاملDesigning Stable ABR Flow Control with Rate Feedback and Open Loop Control: First-Order Control Case
In this paper we present a control-theoretic approach to design stable rate-based Bow control for ATM ABR services. The flow control algorithm that we consider has the most simple form among all the queuelength-based flow control algorithms, and is referred to as Farst-order Rate-based Flow Control (FRFC) since the corresponding closed loop can be modeled as a firstorder retarded differential e...
متن کاملPii: S0166-5316(98)00037-6
In this paper we present a control-theoretic approach to design stable rate-based flow control for ATM ABR services. The flow control algorithm that we consider has the most simple form among all the queue-length-based flow control algorithms, and is referred to as first-order rate-based flow control (FRFC) since the corresponding closed loop can be modeled as a first-order retarded differentia...
متن کاملOn a Generalization of Extended Resolution
Motivated by improved SAT algorithms yielding new worst-case upper bounds) a natural parameterized generalization GER of Extended Resolution (ER) is introduced. ER can simulate polynomially GER, but GER allows special cases for which exponential lower bounds can be proven.
متن کامل