Analysis of a transaction system with checkpointing, failures, and rollback

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Kumar, L., Misra, M., & Mitrani, I. (2002). Analysis of a transaction system with checkpointing, failures, and rollback. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2324 LNCS, pp. 279–288). Springer Verlag. https://doi.org/10.1007/3-540-46029-2_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free