• DocumentCode
    2571604
  • Title

    A Mixed Software Rejuvenation Policy for Multiple Degradations Software System

  • Author

    Du, Xiaozhi ; Qi, Yong ; Hou, Di ; Chen, Ying ; Zhong, Xiao

  • Author_Institution
    Dept. of Comput. Sci. & Technol., Xi´´an Jiaotong Univ., Xi´´an, China
  • fYear
    2009
  • fDate
    25-27 June 2009
  • Firstpage
    376
  • Lastpage
    383
  • Abstract
    Software rejuvenation is a preventive and proactive technology to counteract the phenomenon of software aging and system failures, and to improve the system reliability. In this paper we present a mixed software rejuvenation policy for an operational software system with multiple degradation states, which considers both the history information and the current running state. By this policy, the system is rejuvenated when it achieves to a degradation threshold or it comes to the pre-determined rejuvenation interval. For comparison, standard rejuvenation policy is also discussed. Continuous-time Markov chains are used to describe the multiple degradation states model. To evaluate these polices expediently, we utilize deterministic and stochastic Petri nets (DSPN) to solve the models. Numerical results show that the deployment of software rejuvenation in the system leads to significant improvement in availability and throughput. And the mixed rejuvenation policy is better than the standard rejuvenation policy.
  • Keywords
    Markov processes; software fault tolerance; software maintenance; continuous time Markov chain; degradation threshold; degradations software system; software aging; software rejuvenation policy; system failure; system reliability; Aging; Availability; Communication system software; Degradation; History; Operating systems; Software performance; Software systems; Throughput; Time measurement;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    High Performance Computing and Communications, 2009. HPCC '09. 11th IEEE International Conference on
  • Conference_Location
    Seoul
  • Print_ISBN
    978-1-4244-4600-1
  • Electronic_ISBN
    978-0-7695-3738-2
  • Type

    conf

  • DOI
    10.1109/HPCC.2009.18
  • Filename
    5167017