Detailed Information

Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

Adaptive service scheduling for workflow applications in Service-Oriented Grid

Authors
Chin, Sung HoSuh, TaeweonYu, Heon Chang
Issue Date
6월-2010
Publisher
SPRINGER
Keywords
Service scheduling; Workflow scheduling; Rescheduling; Grid Service; Performance metric
Citation
JOURNAL OF SUPERCOMPUTING, v.52, no.3, pp.253 - 283
Indexed
SCIE
SCOPUS
Journal Title
JOURNAL OF SUPERCOMPUTING
Volume
52
Number
3
Start Page
253
End Page
283
URI
https://scholar.korea.ac.kr/handle/2021.sw.korea/116308
DOI
10.1007/s11227-009-0290-9
ISSN
0920-8542
Abstract
When the workflow application is executed in Service-Oriented Grid (SOG), performance issues such as service scheduling should be considered, to achieve high and stable performance in execution. However, most of the prior works on workflow management neither study the performance issues nor provide evaluation methodologies on the performance of Grid Services. Therefore, it is infeasible to apply for the service scheduling problem in SOG. In this paper, we propose and model evaluation metrics for the Grid Service performance. The metrics are extracted based on common properties of Grid Services and are used to quantify and evaluate the performance of an individual Grid Service. With these metrics, we develop a service scheduling scheme with a list scheduling heuristic, to choose proper and optimal Grid Services for tasks in workflow applications. It ensures high performance in the execution of the workflow applications. In addition, we propose a low-overhead rescheduling method, referred to as Adaptive List Scheduling for Service (ALSS), to adapt to the dynamic nature of a grid environment. ALSS provides stable performance for workflow applications, even in abnormal circumstances. Finally, we design an experimental environment with actual traces and perform simulations to quantify the benefits of our approach. Throughout the experiments, we demonstrate that ALSS outperforms conventional scheduling methods. Our scheme produces a scheduling performance that is superior to AHEFT by 50.2%, SLACK by 50.8%, HEFT by 68.3%, MaxMin by 72.0%, MinMin by 71.0%, and Myopic by 69.8%.
Files in This Item
There are no files associated with this item.
Appears in
Collections
Graduate School > Department of Computer Science and Engineering > 1. Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher Suh, Tae weon photo

Suh, Tae weon
컴퓨터학과
Read more

Altmetrics

Total Views & Downloads

BROWSE