On Demand Check Pointing for Grid Application
Reliability using Communicating Process Model
ABSTRACT:
The objective of the work is to propose an on demand asynchronous check pointing technique for the fault recovery of a grid application in communicating process approach. The formal modelling of processes using LOTOS is done wherein the process features are declared in terms of possibilities of rollback and replicas permitted to accept the assigned tasks as decided by the scheduler. If any process is tending to be faulty in run time that will be detected by check pointing mechanism through the Task Dependency Graph (TDG) and their respective worst case execution time and dead line parameters are used to decide the schedulability. The Asynchronous Check Pointing On Demand (ACP-OD) approach is used to enhance the grid application reliability through the needed fault tolerant services. The scheduling of concurrent tasks can be done using the proposed Concurrent Task Scheduling Algorithm (CTSA) algorithm to recover from the faulty states using replication or rollback techniques. The check pointing and replication mechanisms have been used in which the synchronization between communicating processes is needed to enhance the efficiency of check pointing mechanism. The model is tested with a number of rollback variables treating the application as a Stochastic Activity Network (SAN) using Mobius.
Algorithm / Technique used:
Logging Methods.
Algorithm Description:
Logging can be classified as pessimistic, optimistic, or causal. It is based on the fact that the execution of a process can be modeled as a sequence of state intervals. The execution during a state interval is deterministic. However, each state interval is initiated by a nondeterministic event Now, assume that the system can capture and log sufficient information about the nondeterministic events that initiated the state interval. This is called the piecewise deterministic (PWD) assumption. Then, a crashed process can be recovered by 1) restoring it to the initial state and 2) replaying the logged events to it in the same order they appeared in the execution before the crash. To avoid a rollback to the initial state of a process and to limit the amount of nondeterministic events that need to be replayed, each process periodically saves its local state. Log based mechanisms in which the only nondeterministic events in a system are the reception of messages is usually referred to as message logging.
Existing System:
- Communication Induced Check-pointing protocols usually make the assumption that any process can be check-pointed at any time.
- An alternative approach which releases the constraint of always check-pointable processes, without delaying any do not message reception nor did altering message ordering enforce by the communication layer or by the application.
- This protocol has been implemented within Pro-Active, an open source Java middleware for asynchronous and distributed objects implementing the ASP (Asynchronous Sequential Processes) model.
Proposed System:
- This paper presents two fault-tolerance mechanisms called Theft-Induced Check pointing and Systematic Event Logging.
- These are transparent protocols capable of overcoming problems associated with both benign faults, i.e., crash faults, and node or subnet volatility. Specifically, the protocols base the state of the execution on a dataflow graph, allowing for efficient recovery in dynamic heterogeneous systems as well as multithreaded applications.
Hardware Requirements:
• System : Pentium IV 2.4 GHz.
• Hard Disk : 40 GB.
• Floppy Drive : 1.44 Mb.
• Monitor : 15 VGA Colour.
• Mouse : Logitech.
• Ram : 256 Mb.
Software Requirements:
• Operating system : - Windows XP Professional.
• Coding Language : - Java.
• Tool Used : - Eclipse.
REFERENCE:
Baghavathi Priya, Chandrasekaran Subramaniam and Ravichandran, “On Demand Check Pointing for Grid Application Reliability using Communicating Process Model”, IEEE ICACT 2011, IEEE February 2011.
