liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Estimating Optimal Checkpoint Intervals Using GPSS Simulation
Linköping University, Department of Mathematics.
Linköping University, Department of Mathematics.
2007 (English)Independent thesis Advanced level (degree of Magister), 20 points / 30 hpStudent thesis
Abstract [en]

In this project we illustrate how queueing simulation may be used to find the optimal interval for checkpointing problems and compare results with theoretical computations for simple systems that may be treated analytically.

We consider a relatively simple model for an internet banking facility. From time to time, the application server breaks down. The information at the time of the breakdown has to be passed onto the back up server before service may be resumed. To make the change over as efficient as possible, information of the state of user’s accounts is saved at regular intervals. This is known as checkpointing.

Firstly, we use GPSS (a queueing simulation tool) to find, by simulation, an optimal checkpointing interval, which maximises the efficiency of the server. Two measures of efficiency are considered; the availability of the server and the average time a customer spends in the system. Secondly, we investigate how far the queueing theory can go to providing an analytic solution to the problem and see whether or not this is in line with the results obtained through simulation.

The analysis shows that checkpointing is not necessary if breakdowns occur frequently and log reading after failure does not take much time. Otherwise, checkpointing is necessary and the analysis shows how GPSS may be used to obtain the optimal checkpointing interval. Relatively complicated systems may be simulated, where there are no analytic tools available. In simple cases, where theoretical methods may be used, the results from our simulations correspond with the theoretical calculations.

Place, publisher, year, edition, pages
Matematiska institutionen , 2007. , 48 p.
Keyword [en]
Queueing theory, Checkpointing, Availability, Simulation of queues, M/M/1 with priorities, Server efficiency
National Category
Probability Theory and Statistics
URN: urn:nbn:se:liu:diva-8558ISRN: LiTH-MAT-EX--07/06--SEOAI: diva2:23321
2007-03-16, Kompakta rummet, B-huset, Linköpings universitet, 581 83 Linköping, 16:15
Available from: 2007-04-18 Created: 2007-04-18

Open Access in DiVA

fulltext(970 kB)2019 downloads
File information
File name FULLTEXT01.pdfFile size 970 kBChecksum SHA-1
Type fulltextMimetype application/pdf

By organisation
Department of Mathematics
Probability Theory and Statistics

Search outside of DiVA

GoogleGoogle Scholar
Total: 2019 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 452 hits
ReferencesLink to record
Permanent link

Direct link