Seminar Topics & Project Ideas On Computer Science Electronics Electrical Mechanical Engineering Civil MBA Medicine Nursing Science Physics Mathematics Chemistry ppt pdf doc presentation downloads and Abstract

Full Version: Flexible Rollback Recovery in Dynamic Heterogeneous Grid Computing full report
You're currently viewing a stripped down version of our content. View the full version with proper formatting.
Pages: 1 2
Hi...
anybody have Flexible Rollback Recovery in Dynamic Heterogeneous Grid Computing using
Front End : Microsoft Visual Studio .Net 2005
Language : Visual C#.Net
Back End : SQL Server 2000

pls send that project documentation and reports...

Regards,
ramesh


presented by:
B.KALA ,G.NAGAMANI, K.V.SRINIVAS ,M.ARJUN GOUD

[attachment=8820]
FLEXIBLE ROLLBACK RECOVERY IN DYNAMIC HETEROGENEOUS GRID COMPUTING
INTRODUCTION

Grid Computing
• Virtual computer architecture over distributed process execution.
Computational Grid
- Infrastructure.
- Standard Protocols.
Data Grid
- Share and Manage distributed data.
- Access database.
- High speed data movement.
• Fault Tolerant Grid Computing
• Complexity of infrastructure needs
- Reliability
• The absence of Fault Tolerance mechanisms.
• Need for Rollback Recovery.
EXISTING SYSTEM
• Communication Induced Check-pointing protocols.
• Pro-Active system using Asynchronous Sequential Processes
DISADVANTAGES
 Lack of Heterogeneity and Dynamic nature.
 Probability of failures and crashes are more.
 Reliability decreases and Mean Time to Failures decreases
 Efficient Theft detection
 Rollback recovery
 Reliability
 Mean Time to Failure (MTTF)
[attachment=9004]
FLEXIBLE ROLLBACK RECOVERY IN DYNAMIC HETEROGENEOUS GRID COMPUTING
Aim:

The aim of the project is to present two mechanisms called Theft-Induced Checkpointing and Systematic Event Logging.
Introduction:
Large applications executing on Grid or cluster architectures consisting of computational nodes create problems with reliability.
The source of the problems are node failures and the need for dynamic configuration over extensive runtime.
This paper presents two mechanisms called Theft-Induced Checkpointing and Systematic Event Logging
Scope:
These two mechanisms,Theft-Induced Checkpointing and Systematic Event Logging are transparent protocols.
These protocols are capable of overcoming problems associated with both faults, i.e., crash faults, and node or subnet volatility.
Technology:
Swing:
 Swing components facilitate efficient graphical user interface (GUI) development
 These components are a collection of lightweight visual components
 Swing components contain a replacement for the heavyweight AWT components as well as complex user interface components such as Trees and Tables.
Software requirements
Operating system :: Windows-XP
Front End :: JAVA
Back End :: MySql
Hardware requirements
Processor : Pentium IV 2.4 GHz
Hard disk : 80 GB
Ram : 512 MB
i dnow know how to show a demo of this project


plase help
[attachment=9733]
Flexible Rollback Recovery in Dynamic Heterogeneous Grid Computing
Abstract

Large applications executing on Grid or cluster architectures consisting of hundreds or thousands of computational nodes create problems with respect to reliability. The source of the problems is node failures and the need for dynamic configuration over extensive runtime. By allowing recovery even under different numbers of processors, the approaches are especially suitable for applications with a need for adaptive or reactionary configuration control. The low-cost protocols offer the capability of controlling or bounding the overhead. A formal cost model is presented, followed by an experimental evaluation. It is shown that the overhead of the protocol is very small, and the maximum work lost by a crashed process is small and bounded.
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.
Presented By:
V.Kartheeka
A.Kalpana

[attachment=9754]
Abstract
Large applications executing on Grid or cluster architectures consisting of hundreds or thousands of computational nodes create problems with respect to reliability. The source of the problems is node failures and the need for dynamic configuration over extensive runtime. By allowing recovery even under different numbers of processors, the approaches are especially suitable for applications with a need for adaptive or reactionary configuration control.
The low-cost protocols offer the capability of controlling or bounding the overhead. A formal cost model is presented, followed by an experimental evaluation. It is shown that the overhead of the protocol is very small, and the maximum work lost by a crashed process is small and bounded.
Introduction
What is Grid

A computational grid is a hardware and software infrastructure that provides dependable, consistent, pervasive, and inexpensive access to high-end computational capabilities.
What is Grid Computing
A parallel processing architecture in which CPU resources are shared across a network, and all machines function as one large supercomputer
Introduction cont’d
 Need for Grid Computing:

In the commercial world, grid aims to maximize the utilization of an organization's computing resources by making them shareable across applications and, potentially, provide computing on demand to third parties as a utility service.
 Fault-tolerance
Compute Science, Fault-tolerance is the property of a computer system to continue operation at an acceptable quality, despite the unexpected occurrence of hardware or software failures.
 Roll-back recovery
Roll-back recovery reverts the system state back to some earlier, correct version, for example using check pointing, and moves forward from there. Roll-back recovery requires that the operations between the checkpoint and the detected erroneous state can be made idempotent.
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.
 The 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.
 Model Diagram
 Requirements
Hardware Requirements
SYSTEM : Pentium IV 2.4 GHz
HARD DISK : 40 GB
RAM : 256 MB

Software Requirements
OPERATING SYSTEM :- Windows XP Professional
Technologies Used :- J2SE, JDBC.
DATA BASE SERVER :- MYSQL 5.1
hai.. i am a final year CS student.. this is my seminar topic.. Flexible Rollback Recovery in Dynamic Heterogeneous Grid Computing . actually i want full seminar report for this topic.. please can u help me..
[attachment=10029]
Flexible Rollback Recovery in Dynamic Heterogeneous Grid Computing
Abstract

Large applications executing on Grid or cluster architectures consisting of hundreds or thousands of computational nodes create problems with respect to reliability. The source of the problems is node failures and the need for dynamic configuration over extensive runtime. By allowing recovery even under different numbers of processors, the approaches are especially suitable for applications with a need for adaptive or reactionary configuration control. The low-cost protocols offer the capability of controlling or bounding the overhead. A formal cost model is presented, followed by an experimental evaluation. It is shown that the overhead of the protocol is very small, and the maximum work lost by a crashed process is small and bounded.
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.
Please send me the source code for this project...my mail id:powerbalu533[at]gmail.com
hey.does any one can give me the entire code ,documentation for the topic "The flexible rollback recovery in dynamic heterogeneous grid computing".plz
its urgent
give mefull code sir please please

you can pm me
hi friend this is siva sankar
i need some more information about flexible rollback recovery dynamic heterogenious grid computing,please send how to set path to run this project and some video explanation about this project
hi friends ..
send me future enhancements of this project
my email id prudhviraj29[at]gmail.com
Pages: 1 2