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 language | English (US) |
---|---|
Title of host publication | Proceedings - International Conference on Distributed Computing Systems |
Editors | M.P. Papazoglou, M. Takizawa, B. Kramer, S. Chanson |
Publisher | IEEE |
Pages | 464-471 |
Number of pages | 8 |
State | Published - 1998 |
Event | Proceedings of the 1998 18th International Conference on Distributed Computing Systems - Amsterdam, Neth Duration: May 26 1998 → May 29 1998 |
Other
Other | Proceedings of the 1998 18th International Conference on Distributed Computing Systems |
---|---|
City | Amsterdam, Neth |
Period | 5/26/98 → 5/29/98 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture