Dynamic Adaptation for Grid Computing

نویسندگان

  • Jérémy Buisson
  • Françoise André
  • Jean-Louis Pazat
چکیده

As Grid architectures provide resources that uctuate, applications that should be run on such environments must be able to take into account the changes that may occur. This document describes how applications can be built from components that may dynamically adapt themselves. We propose a generic framework to help the developpers of such components. In the case of a component that encapsulates a parallel code, a consistency model for the dynamic adaptation is de ned. An implementation of a restricted consistency model allowed us to experiment our ideas.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stability Assessment Metamorphic Approach (SAMA) for Effective Scheduling based on Fault Tolerance in Computational Grid

Grid Computing allows coordinated and controlled resource sharing and problem solving in multi-institutional, dynamic virtual organizations. Moreover, fault tolerance and task scheduling is an important issue for large scale computational grid because of its unreliable nature of grid resources. Commonly exploited techniques to realize fault tolerance is periodic Checkpointing that periodically ...

متن کامل

Green Energy-aware task scheduling using the DVFS technique in Cloud Computing

Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...

متن کامل

Parallel Dynamic Grid Refinement for Industrial Applications

This paper covers a description of the algorithms and data-structures used in the parallel DLR TAU-Code Adaptation tool. Attention is given to the basic algorithms of the parallel anisotropic refinement and de-refinement, as well as the data-structures for distributed grids and grid hierarchy. The parallelization issues for distributed data are discussed along with the dynamic repartitioning an...

متن کامل

A dynamic-balanced scheduler for Genetic Algorithms for Grid Computing

The new paradigm of distributed computation, grid computing, has given rise to a large amount of research on resource scheduling. Unlike the distributed computation, grid computing uses heterogeneous resources, for what grid computing entails new challenges as the adaptation of parallel algorithms before developed for homogeneous resources cluster to the dynamic and heterogeneous resources. In ...

متن کامل

Task Scheduling Algorithm Using Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in Cloud Computing

The cloud computing is considered as a computational model which provides the uses requests with resources upon any demand and needs.The need for planning the scheduling of the user's jobs has emerged as an important challenge in the field of cloud computing. It is mainly due to several reasons, including ever-increasing advancements of information technology and an increase of applications and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005