A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Kumar, Parveen
- An Efficient Checkpointing Algorithm for Mobile Distributed Systems
Authors
1 Department of Information Technology, Haryana College of Technology & Management, Kaithal, Haryana, IN
2 Department of Computer Science and Application, Kurukshetra University, Kurukshetra, IN
3 Department Computer Science and Engineering, MIET, Meerut (U.P), IN
Source
Networking and Communication Engineering, Vol 2, No 10 (2010), Pagination: 394-399Abstract
Mobile distributed system is a distributed system with mobile node as well as static node. Due to unique characteristic of mobile nodes likes mobility, limited bandwidth on wireless link, limited battery power backup, limited local storage, frequent disconnection and the handoff, traditional fault tolerance scheme can not be directly applied in mobile distributed systems. Non blocking coordinated checkpointing algorithm which forces minimum number of process to take their checkpoint, are preferred approach for mobile distributed systems. To achieve the goal of non-blocking and minimum- process sometimes, it also requires piggybacking of some extra information onto normal messages or taking some useless checkpoints. As during checkpointing lot of checkpointing information including all variables, the environment, control information register value are transmitted through the wireless links. So these forced/useless checkpoints increase the checkpointing overheads as these are transmitted through the wireless link and require large communication bandwidth and energy. Therefore our efforts are mostly directed towards avoiding the useless checkpoints. In this paper we propose a minimum process non-blocking coordinated checkpointing algorithm which does not take any useless checkpoint and produce consistent global state with minimum number of checkpoints. This approach can significantly save battery energy as well as wireless communication bandwidths.Keywords
Distributed Systems, Mobile Distributed Systems, Domino Effect, Checkpointing, Coordinated, Uncoordinated.- An Efficient Minimum-Process Checkpointing Scheme for Non-Deterministic Mobile Distributed Systems
Authors
1 Meerut Institute of Engineering and Technology, Meerut, IN
2 Singhania University, Pacheri Bari, Rajasthan, IN
Source
Networking and Communication Engineering, Vol 2, No 7 (2010), Pagination: 159-166Abstract
While dealing with mobile distributed systems, we come across some issues like: mobility, low bandwidth of wireless channels and lack of stable storage on mobile nodes, disconnections, limited battery power and high failure rate of mobile nodes. These issues make traditional checkpointing techniques designed for Distributed systems unsuitable for Mobileenvironments. In this paper, we design a minimum process algorithm for Mobile Distributed systems, where no useless checkpoints are taken and an effort has been made to optimize the blocking of processes. We propose to delay the processing of selective messages at the receiver end only during the checkpointing period. A Process is allowed to perform its normal computations and send messages during its blocking period. In this way, we try to keep blocking of processes to bare minimum. In order to keep the blocking time minimum, we collect the dependency vectors and compute the exact minimum set in the beginning of the algorithm. The number of processes that take checkpoints is minimized to 1) avoid awakening of MHs in doze mode of operation, 2) minimize thrashing of MHs with checkpointing activity, 3) save limited battery life of MHs and low bandwidth of wireless channels. In coordinated checkpointing, if a single process fails to take its checkpoint; all the checkpointing effort goes waste, because, each process has to abort its tentative checkpoint. In order to take its tentative checkpoint, an MH needs to transfer large checkpoint data to its local MSS over wireless channels.