𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Self adaptivity in Grid computing

✍ Scribed by Sathish S. Vadhiyar; Jack J. Dongarra

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
274 KB
Volume
17
Category
Article
ISSN
1532-0626

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Optimizing a given software system to exploit the features of the underlying system has been an area of research for many years. Recently, a number of self‐adapting software systems have been designed and developed for various computing environments. In this paper, we discuss the design and implementation of a software system that dynamically adjusts the parallelism of applications executing on computational Grids in accordance with the changing load characteristics of the underlying resources. The migration framework implemented by our software system is aimed at performance‐oriented Grid systems and implements tightly coupled policies for both suspension and migration of executing applications. The suspension and migration policies consider both the load changes on systems as well as the remaining execution times of the applications thereby taking into account both system load and application characteristics. The main goal of our migration framework is to improve the response times for individual applications. We also present some results that demonstrate the usefulness of our migration framework. Published in 2005 by John Wiley & Sons, Ltd.

πŸ“œ SIMILAR VOLUMES

A self-adaptive gridding for inviscid tr
A self-adaptive gridding for inviscid transonic projectile aerodynamics computation
✍ Chen-Chi Hsu; Chyuan-Gen Tu πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 766 KB

Bureau of Planninq. Republic of China N a c d Headquarters ## SUMMARY An adaptive grid generation technique based on modified variational principles coupled with an exponential clustering has been developed and tested successfdly for the computation of steady inviscid transonic projectile aerodyn

Self-avoiding walks over adaptive unstru
Self-avoiding walks over adaptive unstructured grids
✍ Heber, Gerd; Biswas, Rupak; Gao, Guang R. πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 467 KB

In this paper, we present self-avoiding walks as a novel technique to 'linearize' an unstructured mesh. Unlike space-filling curves which are based on a geometric embedding, our strategy is combinatorial since it uses the mesh connectivity only. We formulate a linear time-complexity algorithm for th

Reliability in grid computing systems
Reliability in grid computing systems
✍ Christopher Dabrowski πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 260 KB

## Abstract In recent years, grid technology has emerged as an important tool for solving compute‐intensive problems within the scientific community and in industry. To further the development and adoption of this technology, researchers and practitioners from different disciplines have collaborate

Incentive-based scheduling in Grid compu
Incentive-based scheduling in Grid computing
✍ Yanmin Zhu; Lijuan Xiao; Zhiwei Xu; Lionel M. Ni πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 235 KB