Abstract
We consider a system where transactions are processed by a single server subject to faults and recovery. A checkpoint is attempted after a fixed number of transactions have been completed, and takes some time to establish. The occurrence of a fault causes a rollback to the last checkpoint, after which all intervening transactions are reprocessed. The system is modelled by a two-dimensional Markov process with one unbounded variable (the number of transactions in the queue), and one bounded variable (the number of transactions processed since the last checkpoint). The joint steady-state distribution of the process, and hence the performance measures of interest, is found by two different methods: generating functions and spectral expansion. The problem of determining the optimal checkpointing parameter is considered.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Asmussen, Applied Probability and Queues, Wiley, 1987.
K.M. Chandy, J.C. Browne, C.W. Dissly and W.R. Uhrig, “Analytic models for rollback and recovery strategies in database systems”, IEEE Trans. Soft. Engin., 1, 100–110, 1975.
H.R. Gail, S.L. Hantler and B.A. Taylor, “Spectral analysis of M/G/1 and G/M/1 type Markov chains”, Adv. Appl. Prob., 28, 114–165, 1996.
E. Gelenbe, “On the optimum checkpoint interval”, JACM, 26, 259–270, 1979.
E. Gelenbe and D. Derochette, “Performance of rollback recovery systems under intermittent failures”, CACM, 21, 493–499, 1979.
N. Mikou and S. Tucci, “Analyse et optimisation d’une procédure de reprise dans un système de gestion de données centralisées”, Acta informatica, 12, 321–338, 1979.
I. Mitrani and R. Chakka, “pectral expansion solution for a class of Markov models: application and comparision with the matrix-gemometric method”, Performance Evaluation, 23, 241–260, 1995.
I. Mitrani and P.J.B. King, “Multiprocessor systems with preemptive priorities”, Performance Evaluation 1, 118–125, 1981.
V.F. Nicola and F.J. Kylstra, “A model of checkpointing and recovery with a specified number of transactions between checkpoints”, Procs., Performance’83, North-Holland, 83–100, 1983.
V.F. Nicola and J.M. van Spanje, “Comparative analysis of different models of checkpointing and recovery”, IEEE Transactions on Software Engineering, 16,8, 807–821, 1990.
K.S. Trivedi, Probability and statistics with reliability, queueing and computer science applications, Prentice-Hall, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, L., Misra, M., Mitrani, I. (2002). Analysis of a Transaction System with Checkpointing, Failures, and Rollback. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds) Computer Performance Evaluation: Modelling Techniques and Tools. TOOLS 2002. Lecture Notes in Computer Science, vol 2324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46029-2_21
Download citation
DOI: https://doi.org/10.1007/3-540-46029-2_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43539-6
Online ISBN: 978-3-540-46029-9
eBook Packages: Springer Book Archive