1992
DOI: 10.1109/32.120317
|View full text |Cite
|
Sign up to set email alerts
|

On the optimal checkpointing of critical tasks and transaction-oriented systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
14
0

Year Published

1997
1997
2023
2023

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 40 publications
(14 citation statements)
references
References 11 publications
0
14
0
Order By: Relevance
“…RRC has been the subject of research for both non-real-time [1], [2] [3], [4] and real-time systems [5], [6], [7], [8], [9]. While for non-real-time systems, it is important to minimize the average execution time when RRC is applied, it is for real-time systems important to maximize the probability that a job meets a given deadline, [10].…”
Section: Amentioning
confidence: 99%
“…RRC has been the subject of research for both non-real-time [1], [2] [3], [4] and real-time systems [5], [6], [7], [8], [9]. While for non-real-time systems, it is important to minimize the average execution time when RRC is applied, it is for real-time systems important to maximize the probability that a job meets a given deadline, [10].…”
Section: Amentioning
confidence: 99%
“…Baccelli [1], Chandy et al [5,6], Dohi et al [9], Gelenbe and Derochette [12], Gelenbe [13], Gelenbe and Hernandez [14], Goes and Sumita [15], Grassi et al [16], Kulkarni et al. [17], Nicola and Van Spanje [20], Sumita et al [23] propose performance evaluation models for database recovery, and calculate the optimal checkpoint intervals which maximize the system availability or minimize the mean overhead during the normal operation.…”
Section: Introductionmentioning
confidence: 98%
“…Chandy et al [2,3], Gelenbe and Derochette [4], Gelenbe [5], Grassi et al [9], Kulkarni et al [10], and Nicola and Van Spanje [11] proposed performance evaluation models for database recovery and calculated the optimal checkpoint intervals which maximize and minimize the system availability and the mean overhead during the normal operation, respectively. Toueg and Babaoglu [13] derived a dynamic programming alogrithm which minimizes expected execution times of tasks placing checkpoints between two consecutive tasks under very general assumptions.…”
Section: Introductionmentioning
confidence: 98%