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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Optimal Choice of Checkpointing Interval for High Availability
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, RTSLAB - Real-Time Systems Laboratory.
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, RTSLAB - Real-Time Systems Laboratory.
Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Mathematical Statistics .
2005 (English)In: Pacific Rim Dependable Computing Conference,2005, Los Alamitos, CA, USA: IEEE Computer Society , 2005, 159- p.Conference paper, Published paper (Refereed)
Abstract [en]

Supporting high availability by checkpointing and switching to a backup upon failure of a primary has a cost. Trade-off studies help system architects to decide whether higher availability at the cost of higher response time is to strive for. The decision will lead to configuring a fault-tolerant server for best performance. This paper provides a mathematical model employing queuing theory that helps to compute the optimal checkpointing interval for a primary-backup replicated server. The optimization criterion is system availability. The model guides towards the checkpointing interval that is short enough to give low failover time, but long enough to utilize most of the system resources for servicing client requests. The novelty of the work is the detailed modelling of service times, wait times for earlier calls in the queue, and priority of checkpointing calls over client calls within the queues. Studies on the model in Mathematica and validation of a modelling assumption through simulations are included.

Place, publisher, year, edition, pages
Los Alamitos, CA, USA: IEEE Computer Society , 2005. 159- p.
Keyword [en]
Dependebility, availability, checkpointing, queueing theory
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-30990Local ID: 16674OAI: oai:DiVA.org:liu-30990DiVA: diva2:251813
Available from: 2009-10-09 Created: 2009-10-09

Open Access in DiVA

No full text

Other links

http://www.ida.liu.se/~rtslab/publications/publications.shtml

Authority records BETA

Szentivanyi, DianaNadjm-Tehrani, SiminNoble, John M

Search in DiVA

By author/editor
Szentivanyi, DianaNadjm-Tehrani, SiminNoble, John M
By organisation
The Institute of TechnologyRTSLAB - Real-Time Systems LaboratoryMathematical Statistics
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 342 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf