Adaptable Scheduling Algorithm for Grids with Resource Redeployment Capability

Two distinct characteristics of grid computing systems are resource heterogeneity and availability variation. There are many well-designed scheduling algorithms proposed for heterogeneous computing systems. However, the availability variation is seldom considered in developing scheduling ongoing app...

Full description

Saved in:
Bibliographic Details
Published in:Journal of grid computing 2014-09, Vol.12 (3), p.447-463
Main Authors: Hsu, Chih-Hsuan, Lin, Cho-Chin, Hsu, Tsan-sheng
Format: Article
Language:English
Subjects:
Algorithms
Availability
Computation
Computational grids
Computer Science
Heterogeneity
Management of Computing and Information Systems
Processor Architectures
Resource scheduling
Scheduling
User Interfaces and Human Computer Interaction
Workflow
Workflow software
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Two distinct characteristics of grid computing systems are resource heterogeneity and availability variation. There are many well-designed scheduling algorithms proposed for heterogeneous computing systems. However, the availability variation is seldom considered in developing scheduling ongoing applications on a grid. In this paper, two scheduling algorithms called AMOF and AMOSF are proposed. Both of them consider availability variation as well as resource heterogeneity while scheduling an ongoing workflow application on the grid. An experiment has been conducted to demonstrate that AMOF and AMOSF algorithms outperform the well-known scheduling algorithms: GS and HEFT in most of the cases.
ISSN:1570-7873
1572-9184
DOI:10.1007/s10723-014-9298-3