Area Difference Based Recovery Information Placement for Mobile Computing Systems

In a mobile computing system, mobile hosts may move around cells, resulting in a considerable cost for locating and retrieving the recovery information, which is necessary for fault tolerance. To speed up the recovery, traditionally, recovery information is migrated according to the location of the mobile host. In this paper, a scheme for efficiently handling the recovery information is proposed. When a mobile host moves out of a certain range, only partial recovery information of the mobile host needs to be migrated to mobile support stations. It can avoid the unnecessary migration of recovery information. Moreover, the performance of the proposed scheme is evaluated and compared with the traditional movement based scheme.

[1]  Richard D. Schlichting,et al.  Fail-stop processors: an approach to designing fault-tolerant computing systems , 1983, TOCS.

[2]  Sean W. Smith,et al.  Completely asynchronous optimistic recovery with minimal rollbacks , 1995, Twenty-Fifth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[3]  Yi-Min Wang,et al.  Optimal message log reclamation for uncoordinated checkpointing , 1994, Proceedings of IEEE Workshop on Fault-Tolerant Parallel and Distributed Systems.

[4]  David B. Johnson,et al.  Recovery in Distributed Systems Using Optimistic Message Logging and Checkpointing , 1988, J. Algorithms.

[5]  Lorenzo Alvisi,et al.  Scalable Causal Message Logging for Wide-Area Environments , 2001, Euro-Par.

[6]  Heon Young Yeom,et al.  An efficient recovery scheme for fault-tolerant mobile computing systems , 2003, Future Gener. Comput. Syst..

[7]  Kishor S. Trivedi.  Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[8]  Willy Zwaenepoel,et al.  Manetho: Transparent Rollback-Recovery with Low Overhead, Limited Rollback, and Fast Output Commit , 1992, IEEE Trans. Computers.

[9]  Mukesh Singhal,et al.  Low-cost checkpointing with mutable checkpoints in mobile computing systems , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[10]  David B. Johnson,et al.  Sender-Based Message Logging , 1987 .

[11]  Lorenzo Alvisi,et al.  Causality tracking in causal message-logging protocols , 2002, Distributed Computing.

[12]  Lorenzo Alvisi,et al.  Reasons for a pessimistic or optimistic message logging protocol in MPI uncoordinated failure, recovery , 2009, 2009 IEEE International Conference on Cluster Computing and Workshops.

[13]  David L. Presotto,et al.  Publishing: a reliable broadcast communication mechanism , 1983, SOSP '83.

[14]  Heon Young Yeom,et al.  An asynchronous recovery scheme based on optimistic message logging for mobile computing systems , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[15]  Vijay K. Garg,et al.  Distributed recovery with K-optimistic logging , 2003, J. Parallel Distributed Comput..

[16]  W. Kent Fuchs,et al.  Checkpoint Space Reclamation for Uncoordinated Checkpointing in Message-Passing Systems , 1995, IEEE Trans. Parallel Distributed Syst..