An Analysis of Checkpointing Algorithms for Distributed Mobile Systems
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 4
Abstract
Distributed snapshots are an important building block for istributed systems, and are useful for constructing efficient checkpointing protocols, among other uses. Direct application of these algorithms to mobile systems is not feasible, however, due to differences in the environment in which mobile systems operate, relative to general distributed systems. The mobile computing environment introduces new challenges in the area of fault-tolerant computing. Compared to traditional distributed environments, wireless networks are typically slower, providing lower throughput and latency, comparing to wireline networks. In addition, the mobile hosts have limited computation esources, are often exposed to harsh operating environment that makes them more likely to fail, and can roam while perating. Over the past two decades, intensive research work has been carried out on providing efficient checkpointing protocols in traditional distributed computing. Recently, more attention has been paid to providing checkpointing protocols for mobile systems. Some of these protocols have been adapted from the raditional distributed environment; others have been created from scratch for mobile systems. heckpoint is defined as a designated place in a program at which normal processing is interrupted specifically to preserve the status information necessary to allow resumption of processing at a later time. Checkpointing is the process of saving the status information. This paper surveys the algorithms which have been reported in the literature for checkpointing in Mobile Distributed systems.
Authors and Affiliations
Ajay Khunteta , Praveen Kumar
Keywords
Related Articles
- EP ID EP124239
- DOI -
- Views 112
- Downloads 0
Ternary Hierarchical Clustering with Data De-Duplication in Sensor Networks
Wireless Sensor Networks are resource constrained application specific adhoc networks. All the previous works have concentrated on the power aware techniques such as data aggregation, coordination of node operations for...
End to End delay analytical estimation of NoC with VBR traffic
Network On Chip (NoC) integrate real time application that require strength performance guaranties, usually enforced by a tight upper bound on the maximum end-to-end delay. The complex and unpredictable nature of data tr...
Test Case Reduction Technique for Semantic Based Web Services
Web Services (WS) are the basic building blocks for every e-business applications. They provide efficient reusability mechanism, thereby reducing the development time and cost. Web services can be identified by Uniform R...
SEVERITY BASED CODE OPTIMIZATION : A DATA MINING APPROACH
Billions of lines of code are currently running in Legacy systems, mainly running machine critical systems. Large organizations and as well as small organizations extensively rely on IT infrastructure as the backbone. Th...
Comparision Of Traditional Method of Histogram Equalisation with HSV and Kekre Transform for Content Based Image Retrieval
Content-based image retrieval system based on an efficient combination of both colours and features is explained in this paper. According to Kekre’s Transform, feature vectors are formed using a combination of row mean a...