DocumentCode
1860388
Title
Low-cost checkpointing with mutable checkpoints in mobile computing systems
Author
Cao, Guohong ; Singhal, Mukesh
Author_Institution
Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA
fYear
1998
fDate
26-29 May 1998
Firstpage
464
Lastpage
471
Abstract
Mobile computing raises many new issues, such as lack of stable storage, low bandwidth of wireless channel, high mobility, and limited battery life. These new issues make traditional checkpointing algorithms unsuitable. We introduce the concept of mutable checkpoint, which is neither a tentative checkpoint nor a permanent checkpoint. Mutable checkpoints can be saved anywhere; e.g., the memory or local disk of MHs. In this way, taking a mutable checkpoint avoids the overhead of transferring a large amount of data to the stable storage in MSS over the wireless network. Based on mutable checkpoints, our non-blocking algorithm avoids the avalanche effect, minimizes the number of synchronization messages and forces only a minimum number of processes to take their checkpoints on the stable storage
Keywords
fault tolerant computing; message passing; synchronisation; system recovery; wireless LAN; avalanche effect; high mobility; limited battery life; low bandwidth; low-cost checkpointing; message exchange; mobile computing systems; mutable checkpoints; nonblocking algorithm; stable storage; synchronization messages; wireless network; Algorithm design and analysis; Bandwidth; Batteries; Checkpointing; Computer networks; Distributed computing; Information science; Mobile computing; Routing; Wireless networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems, 1998. Proceedings. 18th International Conference on
Conference_Location
Amsterdam
ISSN
1063-6927
Print_ISBN
0-8186-8292-2
Type
conf
DOI
10.1109/ICDCS.1998.679776
Filename
679776
Link To Document