Low-cost checkpointing with mutable checkpoints in mobile computing systems

Guohong Cao, M. Singhal

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Scopus citations

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. In this paper, we introduce the concept of 'mutable checkpoint', which is neither a tentative checkpoint nor a permanent checkpoint. Mutable checkpoints can be saved any where; e.g., the memory or local disk of MHs. In this way, taking a mutable checkpoint avoids the overhead of transferring large amount of data to the stable storage in MSS over the wireless network. Based on mutable checkpoints, our non-blocking algorithm avoids avalanche effect, minimizes the number of synchronization messages, and forces only a minimum number of processes to take their checkpoints on the stable storage.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Distributed Computing Systems
EditorsM.P. Papazoglou, M. Takizawa, B. Kramer, S. Chanson
PublisherIEEE
Pages464-471
Number of pages8
StatePublished - 1998
EventProceedings of the 1998 18th International Conference on Distributed Computing Systems - Amsterdam, Neth
Duration: May 26 1998May 29 1998

Other

OtherProceedings of the 1998 18th International Conference on Distributed Computing Systems
CityAmsterdam, Neth
Period5/26/985/29/98

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Low-cost checkpointing with mutable checkpoints in mobile computing systems'. Together they form a unique fingerprint.

Cite this