Deakin home > Deakin University Library > Deakin Research Online > The cost of storing checkpoints to multiple volatile storage locations using at-least-k semantics

The cost of storing checkpoints to multiple volatile storage locations using at-least-k semantics

Maloney, Andrew and Goscinski, Andrzej 2007, The cost of storing checkpoints to multiple volatile storage locations using at-least-k semantics, in Proceedings of the 13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007), IEEE Computer Society, Los Alamitos, Calif., pp. 330-333.

Attached Files (Some files may be inaccessible until you login with your Deakin Research Online credentials)
Name Description MIMEType Size Downloads

Title The cost of storing checkpoints to multiple volatile storage locations using at-least-k semantics
Author(s) Maloney, Andrew
Goscinski, Andrzej
Conference name IEEE International Symposium on Pacific Rim Dependable Computing (13th: 2007: Melbourne, Vic.)
Conference location Melbourne, Vic.
Conference dates 17-19 December 2007
Title of proceedings Proceedings of the 13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)
Editor(s) Hobbs, Michael
Huang, Yennun
Kuo, Sy-Yen
Zhou, Wanlei
Publication date 2007
Conference series International Symposium on Pacific Rim Dependable Computing
Start page 330
End page 333
Publisher IEEE Computer Society
Place of publication Los Alamitos, Calif.
Summary Using the volatile memory of other computers within 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 GENESIS 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.
ISBN 0769530540
9780769530543
Language eng
Field of Research 080399 Computer Software not elsewhere classified
HERDC Research category E1 Full written paper - refereed
Copyright notice ©2007, Crown Copyright
Persistent URL http://hdl.handle.net/10536/DRO/DU:30008009

Document type: Conference Paper
Collection: School of Engineering and Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.

Versions
Version Filter Type
Access Statistics: 333 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Mon, 29 Sep 2008, 09:03:27 EST