Asynchronous Checkpointing Scheme For Distributed Mobile Computing Environment

Asynchronous Checkpointing Scheme for Distributed Mobile Computing Environment

In this work a fast and efficient recovery algorithm for distributed systems is presented. The concept of communication-induced checkpointing is used for taking checkpoints. The main feature of the recovery algorithm is that it is executed simultaneously by all participating processes while determining a maximum consistent state. It offers fast execution. The time overhead of the recovery algorithm is reduced further significantly because it avoids all unnecessary comparisons in each iteration while determining a consistent global checkpoint. Besides the algorithm does not require piggybacking of any control information with an application message unlike some existing methods. We have shown that the recovery algorithm can be easily modified to obtain a maximum strongly consistent state of checkpoints. Finally we have shown how the algorithm can be extended for the Mobile Computing environment.

Advances and Applications in Mobile Computing

Advances and Applications in Mobile Computing offers guidelines on how mobile software services can be used in order to simplify the mobile users' life. The main contribution of this book is enhancing mobile software application development stages as analysis, design, development and test. Also, recent mobile network technologies such as algorithms, decreasing energy consumption in mobile network, and fault tolerance in distributed mobile computing are the main concern of the first section. In the mobile software life cycle section, the chapter on human computer interaction discusses mobile device handset design strategies, following the chapters on mobile application testing strategies. The last section, mobile applications as service, covers different mobile solutions and different application sectors.

The ... International Conference on Distributed Computing Systems