Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/12927
Title: | Using two-level stable storage for efficient checkpointing | Authors: | Silva, L. M. Silva, J. G. |
Issue Date: | Nov-1998 | Publisher: | IEEE | Citation: | IEE Proceedings - Software. 145:6 (1998) 198-202 | Abstract: | Checkpointing and rollback recovery is a very effective technique to tolerate the occurrence of failures. Usually, checkpoint data is saved on disk, however, in some situations the time to write the data to disk can represent a considerable performance overhead. Alternative solutions would make use of main memory to maintain the checkpoint data. The paper starts by presenting two main memory checkpointing schemes: neighbour based and parity checkpointing. Both schemes have been implemented and evaluated in a commercial parallel machine. The results show that neighbour based checkpointing presents a very low performance overhead and assures a fast recovery for partial failures. However, it is not able to tolerate multiple and total failures of the system. To solve this shortcoming the authors propose a two-level stable storage integrating the use of neighbour based with disk based checkpointing. This approach combines the advantages of the This approach combines the advantages of the two schemes: the efficiency of diskless checkpointing with the high reliability of disk based checkpointing | URI: | https://hdl.handle.net/10316/12927 | ISSN: | 1462-5970 | DOI: | 10.1049/ip-sen:19982440 | Rights: | openAccess |
Appears in Collections: | FCTUC Eng.Informática - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Using two-level stable storage.pdf | 586.37 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.