Multi-Level Diskless Checkpointing

Aim
The mainstay of this project is to arrange the checkpointing arrangement in mobile Grid computing using Reliability Driven Methodology.

Abstract
Mobile Grids (MoGs) are receiving growing attention and expected to become a critical part of future in distributed or parallel computing systems. This study proposes a new approach to enhance neighbor-based diskless checkpointing to tolerate multiple failures using simple checkpointing and failure recovery operations, without relying on dedicated checkpoint processors. Grid involving mobile hosts to facilitate user access to the Grid and to also offer computing resources. A MoG can involve a number of mobile hosts (MHs), i.e., laptop computers. Diskless checkpointing is an efficient technique to tolerate a small number of process failures in large parallel and distributed systems N-level diskless checkpointing scheme achieves lower fault tolerance overhead than the one-level Reed-Solomon checkpointing scheme for N simultaneous processor failures. a simultaneous failure of no morethan N processes is often tolerated by using a one-level ReedSolomon checkpointing scheme for N simultaneous process failures, whose overhead often increases quickly as N increases.

Due to mobility and intermittent wireless link loss, all such scenarios call for robust checkpointing and recovery to support execution, minimizing execution rewind, and recovery rollback delay penalties. Depending upon the applications or jobs tolerance for such delay (i.e., a QoS metric), its performance can be poor or it can be rendered totally inoperative and useless. The proposed scheme allows failure recovery to be performed in a distributed manner using XOR operations. Our Reliability Driven middleware, allows an MoG scheduler to make informed decisions, selectively submitting job portions to hosts having superior checkpointing arrangements in order to ensure successful completion by 1) providing highly reliable checkpointing, increasing the probability of successful recovery, minimizing rollback delay, and 2) providing performance prediction to the scheduler, enabling the clients specified maximum delay tolerance to be better negotiated and matched with MoG resource capabilities.

Existing System
In our Existing System a host or link failure may lead to severe performance degradation or even total job abortion, unless execution checkpointing is incorporated. A moving MH associated with a fixed, unique BS, so successive checkpoints may be found on BS. Checkpointing in Wired Grid Computing System is not considering. Because recent work on portable checkpointing for wired Grids assumes a centralized middleware support for applications, checkpointing, and recovery.

Proposed System
In our Proposed System the MH check pointing arrangement mechanism, seeking superior check pointing arrangements to maximize the probability of distributed application completion without sustaining an unrecoverable failure Using XOR operations and stores only the parity result in its memory. N-level diskless checkpointing scheme achieves lower fault tolerance overhead than the one-level Reed-Solomon checkpointing scheme for N simultaneous processor failures.

Checkpointing forces hosts involved in job execution to periodically save intermediate states, registers, process control blocks, messages, i.e. stability.

Software Requirements
Windows operating system 2000 and above JDK 1.6 JavaFX

Hardware Requirements
Hard Disk: 20GB and Above RAM: 512MB and Above Processor: Pentium III and Above