Performance comparison of hierarchical checkpoint protocols grid computing

Abstract

-46- Abstract -Grid infrastructure is a large set of nodes geographically distributed and connected by a communication. In this context, fault tolerance is a necessity imposed by the distribution that poses a number of problems related to the heterogeneity of hardware, operating systems, networks, middleware, applications, the dynamic resource, the scalability, the lack of common memory, the lack of a common clock, the asynchronous communication between processes. To improve the robustness of supercomputing applications in the presence of failures, many techniques have been developed to provide resistance to these faults of the system. Fault tolerance is intended to allow the system to provide service as specified in spite of occurrences of faults. It appears as an indispensable element in distributed systems. To meet this need, several techniques have been proposed in the literature. We will study the protocols based on rollback recovery. These protocols are classified into two categories: coordinated checkpointing and rollback protocols and log-based independent checkpointing protocols or message logging protocols. However, the performance of a protocol depends on the characteristics of the system, network and applications running. Faced with the constraints of large-scale environments, many of algorithms of the literature showed inadequate. Given an application environment and a system, it is not easy to identify the recovery protocol that is most appropriate for a cluster or hierarchical environment, like grid computing. While some protocols have been used successfully in small scale, they are not suitable for use in large scale. Hence there is a need to implement these protocols in a hierarchical fashion to compare their performance in grid computing. In this paper, we propose hierarchical version of four well-known protocols. We have implemented and compare the performance of these protocols in clusters and grid computing using the Omnet++ simulator.

Data-Aware Scheduling Strategy for Scientific Workflow Applications in IaaS Cloud Computing

“…A budget is often defined as the number of the maximum virtual machines to process workflow. Also in grid computing, several cost-aware scheduling techniques have been introduced [9]. In [10], the authors introduce a strategy called ADAS (Adaptive Data Scheduling) for workflow applications.…”

Dynamic, ecological, accessible and 3D Virtual Worlds-based Libraries using OpenSim and Sloodle along with mobile location and NFC for checking in

“…As seen, it is necessary to involve quite a lot of human resources, as researchers, Engineers, software developers, university students, research groups in the field of network architecture and broadband access to high speed Internet, Grid computing [18] and SOA services and a community of architects builders and 3D metaverse designers [22].…”