skip to main content
Idioma:
Primo Search
Clear Search Box
Search in: Busca Geral
Busca Avançada
Busca por Índices

Efficient modeling and optimizing of checkpointing in concurrent component-based software systems

Bajunaid, Noor ; Menascé, Daniel A.

The Journal of systems and software, 2018-05, Vol.139, p.1-13 [Periódico revisado por pares]

Elsevier Inc

Texto completo disponível

Citações Citado por
  • Título:
    Efficient modeling and optimizing of checkpointing in concurrent component-based software systems
  • Autor: Bajunaid, Noor ; Menascé, Daniel A.
  • Assuntos: Checkpointing ; Concurrent and heterogeneous component-based software systems ; Markov Chains ; Mean value analysis ; Performance modeling
  • É parte de: The Journal of systems and software, 2018-05, Vol.139, p.1-13
  • Descrição: •Analytic models of heterogeneous concurrent software components and checkpointing.•Checkpointing models based on Markov Chains and queuing network models.•CPT: queuing network model for software Component Phase Transitions.•Efficient runtime modeling with CPT of concurrent heterogeneous checkpointing systems.•An optimizer for runtime determination of near-optimal checkpointing intervals. A common mechanism to improve availability and performance is checkpointing and rollback. When it is time to checkpoint, a system stores a job’s state to nonvolatile memory, and, when a failure occurs, it rolls back to the latest stored state instead of restarting the job from the beginning, thus improving performance in the presence of failures. Too frequent checkpointing reduces the amount of work to be redone in case of failures but generates excessive overhead, degrading performance. This paper presents a novel and very efficient queuing network model that addresses software component contention for hardware resources and shows how it can be used to model checkpointing in heterogeneous component-based software systems. We validated this model against a previous model, developed by the authors, that used Markov Chains. Our new model is orders of magnitude faster than the previous one and can be used to plan for checkpointing at run-time. As an additional contribution of this paper, we present an optimizer to find, for each software component, the optimal checkpointing interval that minimizes execution time, maximizes availability, or minimizes checkpointing overhead.
  • Editor: Elsevier Inc
  • Idioma: Inglês
Voltar para lista de resultados

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.