A Dynamic Programming Algorithm for Software Rejuvenation Scheduling under Distributed Computation Circumstance
Hiroyuki Okamura, Kazuki Iwamoto, Tadashi Dohi · 2006
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 paper, we consider a scheduling problem of software rejuvenation for a distributed computation. Based on the dynamic programming approach, 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 failure phenomenon to the resulting optimal rejuvenation schedule