In wireless sensor networks, system architectures and applications are designed to consider both resource constraints and scalability, because such networks are composed of numerous sensor nodes with various sensors and actuators, small memories, low-power microprocessors, radio modules, and batteries. Clustering routing protocols based on data aggregation schemes aimed at minimizing packet num...

This work provides an optimal checkpointing strategy to protect iterative applications from fail-stop errors. We consider a general framework, where the application repeats same execution pattern by executing consecutive iterations, and each iteration is composed of several tasks. These tasks have different lengths checkpoint costs. Assume that there are <i xmlns:mml="http://www.w3.org/1998/Mat...

This paper introduces an effective communication-induced checkpointing protocol using message logging to enable the number of extra checkpoints be far lower than previous number. Even if a situation occurs in which it is decided that process receiving has perform forced checkpointing, our allows skip action recognizes state its sender right before receipt recoverable. Additionally, thus not req...

Mobile computing systems are expected to revolutionize the way computers are used. Mobile hosts have small memory, a relatively slow processor and low power batteries, and communicate over low bandwidth wireless communication links. In this paper, we address the problem of failure recovery in mobile computing systems. Any recovery method for mobile computing systems should take into considerati...

Nowadays there is need of high performance of computer system in distributed environment. As the system mean time before failure correspondingly drops, applications must checkpoint frequently to make progress. However, at scale, the cost of checkpointing becomes prohibitive. A solution to this problem is multilevel checkpointing, which employs multiple types of checkpoints in a single run. Ligh...

Traditional message passing based checkpointing and rollback recovery algorithms perform well for closely coupled systems. In wide area distributed systems these algorithms may incur large overhead due to message passing delay and network traffic. So to design checkpointing and rollback recovery algorithms for wide area distributed systems, mobile agents are introduced. Network topology is assu...

Checkpointing is a simple technique for rollback recovery: the state of an executing program is periodically saved to a disk le from which it can be recovered after a failure. hile recent research has developed a collection of powerful techniques for minimizing the overhead of writing checkpoint les, checkpointing remains unavailable to most application developers. In this paper we describe lib...

Checkpointing with rollback recovery is a well-known method for achieving fault-tolerance in distributed systems. In this work, we introduce algorithms for checkpointing and rollback recovery on asynchronous unidirectional and bi-directional ring networks. The proposed checkpointing algorithms can handle multiple concurrent initiations by different processes. While taking checkpoints, processes...

Nowadays multicore processors are increasingly being deployed in high performance computing systems. As the complexity of systems increases, the probability of failure increases substantially. Therefore, the system requires techniques for supporting fault tolerance. Checkpointing is one of the prevalent fault tolerant techniques reducing the execution time of long-running programs in presence o...