Optimal Rejuvenation Scheduling of Distributed Computation Based on Dynamic Programming
نویسندگان
چکیده
Recently, a complementary approach to handle transient software failures, called software rejuvenation, is becoming popular as a proactive fault management technique in operational software systems. In this study, we develop the optimal scheduling algorithms to trigger software rejuvenation in distributed computation circumstance. In particular, we focus on two different computation circumstances in terms of detection of failures. Based on the dynamic programming, we derive the optimal software rejuvenation schedule which minimizes the expected total time of computation. In numerical examples, we examine the sensitivity of model parameters characterizing the failure phenomenon to the resulting optimal rejuvenation schedule.
منابع مشابه
Dynamic configuration and collaborative scheduling in supply chains based on scalable multi-agent architecture
Due to diversified and frequently changing demands from customers, technological advances and global competition, manufacturers rely on collaboration with their business partners to share costs, risks and expertise. How to take advantage of advancement of technologies to effectively support operations and create competitive advantage is critical for manufacturers to survive. To respond to these...
متن کاملScheduling Nurse Shifts Using Goal Programming Based on Nurse Preferences: A Case Study in an Emergency Department
Nowadays, nurses scheduling is one of the most important challenges with which health care centers are encountered. The significance of nurses’ work quality has led researchers to be concerned about scheduling problems, which have an impact on nurses’ performance. Observing the interests of hospital and patients, providing their satisfaction, and meeting their needs are among the main objective...
متن کاملStochastic Reactive Production Scheduling by Multi-agent Based Asynchronous Approximate Dynamic Programming
The paper investigates a stochastic production scheduling problem with unrelated parallel machines. A closed-loop scheduling technique is presented that on-line controls the production process. To achieve this, the scheduling problem is reformulated as a special Markov Decision Process. A near-optimal control policy of the resulted MDP is calculated in a homogeneous multi-agent system. Each age...
متن کاملA Project Scheduling Method Based on Fuzzy Theory
In this paper a new method based on fuzzy theory is developed to solve the project scheduling problem under fuzzy environment. Assuming that the duration of activities are trapezoidal fuzzy numbers (TFN), in this method we compute several project characteristics such as earliest times, latest times, and, slack times in term of TFN. In this method, we introduce a new approach which we call modif...
متن کاملFeasibility study of presenting a dynamic stochastic model based on mixed integer second-order conic programming to solve optimal distribution network reconfiguration in the presence of resources and demand-side management
Nowadays, with the use of devices such as fossil distributed generation and renewable energy resources and energy storage systems that are operated at the level of distribution networks, the problem of optimal reconfiguration has faced major challenges, so any change in the power of this resources can have different results in reconfiguration. Similarly, load changes during the day can lead to ...
متن کامل