loading...
The Cost of Storing Checkpoints to Multiple Volatile Storage Locations Using at-least-k Semantics
Melbourne, Victoria, Australia December 17-December 19
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PRDC.2007.6213th Pacific Rim International Sympos ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Andrew Maloney, Andrzej Goscinski, "The Cost of Storing Checkpoints to Multiple Volatile Storage Locations Using at-least-k Semantics," Pacific Rim International Symposium on Dependable Computing, IEEE, pp. 330-333, 13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/PRDC.2007.62,
author = {Andrew Maloney and Andrzej Goscinski},
title = {The Cost of Storing Checkpoints to Multiple Volatile Storage Locations Using at-least-k Semantics},
journal ={Pacific Rim International Symposium on Dependable Computing, IEEE},
volume = {0},
year = {2007},
isbn = {0-7695-3054-0},
pages = {330-333},
doi = {http://doi.ieeecomputersociety.org/10.1109/PRDC.2007.62},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Pacific Rim International Symposium on Dependable Computing, IEEE
TI - The Cost of Storing Checkpoints to Multiple Volatile Storage Locations Using at-least-k Semantics
SN - 0-7695-3054-0
SP330
EP333
A1 - Andrew Maloney,
A1 - Andrzej Goscinski,
PY - 2007
VL - 0
JA - Pacific Rim International Symposium on Dependable Computing, IEEE
ER -
 
a system to store checkpoints is an alternative to the traditional approach of using stable storage. The objective of this study is to develop a storage mechanism using at least k delivery semantics. This semantics allows data to be saved to a minimum number of computers simultaneously using group communications, without requiring that each group computer successfully acknowledge the receipt. The new storage mechanism is implemented in the GE ESIS checkpointing facility v2.0. The results showed that at least k storage mechanisms provide low storage latency times; however, the incurred execution overheads on the applications executing within the system are higher than that when using remote stable storage to store checkpoints.
Citation:
Andrew Maloney, Andrzej Goscinski, "The Cost of Storing Checkpoints to Multiple Volatile Storage Locations Using at-least-k Semantics," prdc, pp.330-333, 13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.