Adaptive workflow scheduling strategy in service-based grids

Authors:
JongHyuk Lee;SungHo Chin;HwaMin Lee;TaeMyoung Yoon;KwangSik Chung;HeonChang Yu
Affiliations:
Dept. of Computer Science Education, Korea University;Dept. of Computer Science Education, Korea University;The Korean Intellectual Property Office;Dept. of Computer Science Education, Korea University;Dept. of Computer Science, Korea National Open University;Dept. of Computer Science Education, Korea University
Venue:
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
Year:
2007

Citing 6
Cited 1

Molecular docking using shape descriptors

Journal of Computational Chemistry
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Journal of the ACM (JACM)
Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems

HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Heuristics for Scheduling Parameter Sweep Applications in Grid Environments

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
The Anatomy of the Grid: Enabling Scalable Virtual Organizations

International Journal of High Performance Computing Applications

Execution of service workflows in grid environments

International Journal of Communication Networks and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

During the past several years, the grid application executed same jobs on one or more hosts in parallel, but the recent grid application is requested to execute different jobs linearly. That is, the grid application takes the form of workflow application. In general, efficient scheduling of workflow applications is based on heuristic scheduling method. The heuristic considering relation between hosts would improve execution time in workflow applications. But because of the heterogeneity and dynamic nature of grid resources, it is hard to predict the performance of grid application. In addition, it is necessary to deal with user's QoS as like performance guarantee. In this paper, we propose a service model for predicting performance and an adaptive workflow scheduling strategy, which uses maximum flow algorithms for the relation of services and user's QoS. Experimental results show that the performance of our proposed scheduling strategy is better than common-used greedy strategies.