GRID COMPUTING AND CHECKPOINT APPROACH
Journal Title: International Journal of Computer Science and Management Studies (IJCSMS) www.ijcsms.com - Year 2011, Vol 11, Issue 1
Abstract
Grid computing is a means of allocating the computational power of a large number of computers to complex difficult computation or problem. Grid computing is a distributed computing paradigm that differs from traditional distributed computing in that it is aimed toward large scale systems that even span organizational boundaries. In this paper we investigate the different techniques of fault tolerance which are used in many real time distributed systems. The main focus is on types of fault occurring in the system, fault detection techniques and the recovery techniques used. A fault can occur due to link failure, resource failure or by any other reason is to be tolerated for working the system smoothly and accurately. These faults can be detected and recovered by many techniques used accordingly. An appropriate fault detector can avoid loss due to system crash and reliable fault tolerance technique can save from system failure. This paper provides how these methods are applied to detect and tolerate faults from various Real Time Distributed Systems. The advantages of utilizing the check pointing functionality are obvious; however so far the Grid community has not developed a widely accepted standard that would allow the Grid environment to consciously utilize low level check pointing packages. Therefore, such a standard named Grid Check pointing Architecture is being designed.
Authors and Affiliations
Pankaj Gupta
Specification Representation and Test Case Reduction by Analyzing the Interaction Patterns in System Model
Extended Finite State Machine uses the formal description language to model the requirement specification of the system. The system models are frequently changed because of the specification changes. We can show the chan...
Securing Route Discovery in MANETs: Analysis and Improvement
In this paper, we show that the security proof for the route discovery algorithm end air A is flawed, and moreover, this algorithm is vulnerable to a hidden channel attack. We also analyze the security framework that was...
ON-LINE ANALYTICAL PROCESSING (OLAP) ON NETWORKS
We propose a framework for efficient OLAP on networks with a focus on the most interesting kind, the topological OLAP (called “T- OLAP”), which incurs topological changes in the underlying networks. Topological OLAP oper...
Effect of Line-Width Variation in Radio over Fiber System Based On Optical Single Side Band for Short Haul Communication
Carrier to Noise Ratio (CNR) has been investigated for radio over fiber systems including the effects of variation in the RF oscillator linewidth in this paper. Optical Single sideband signal is studied as it has tolera...
A Handoff Mechanism in VANET Using Mobile Agent A HANDOFF MECHANISM IN VANET USING MOBILE AGENT A HANDOFF MECHANISM IN VANET USING MOBILE AGENT
Nowadays, everything is moving towards the infrastructure less wireless environment to bring the smartness of the society. In this situation, it is necessary to bring the smart technologies in the adhoc network environ...