An Efficient Time-Based Checkpointing Protocol for Mobile Computing Systems over Wide Area Networks (Research Note)

Authors:
Chi-Yi Lin;Szu-Chi Wang;Sy-Yen Kuo
Affiliations:
-;-;-
Venue:
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Year:
2002

Citing 7
Cited 0

Low-Cost Checkpointing and Failure Recovery in Mobile Computing Systems

IEEE Transactions on Parallel and Distributed Systems
Adaptive recovery for mobile environments

Communications of the ACM
Mutable Checkpoints: A New Checkpointing Approach for Mobile Computing Systems

IEEE Transactions on Parallel and Distributed Systems
Checkpointing distributed applications on mobile computers

PDIS '94 Proceedings of the third international conference on on Parallel and distributed information systems
On the Impossibility of Min-Process Non-Blocking Checkpointing and An Efficient Checkpointing Algorithm for Mobile Computing Systems

ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Hybrid Checkpoint Protocol for Supporting Mobile-to-Mobile Communication

ICOIN '01 Proceedings of the The 15th International Conference on Information Networking
An Efficient Recovery Scheme for Mobile Computing Environments

ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, an efficient time-based coordinated checkpointing protocol for mobile computing systems is proposed. The main difference from traditional time-based protocols is that our protocol tries to reduce the number of checkpoints per checkpointing process, at the expense of only a small number of coordinating messages. Additionally, the protocol improves the mechanism of timer synchronization by taking advantage of the reliable timers in the mobile support stations, so that it is well adapted to mobile computing systems over wide area networks.