SHERP

Optimizing the Execution Time of the SLA-Based Workflow in the Grid with Parallel Processing Technology

Cited 0 time in webofscience Cited 0 time in scopus
Authors
Quan, Dang Minh; Altmann, Jorn; Yang, Laurence T.
Issue Date
2008-12
Publisher
IEEE APSCC 2008
Citation
IEEE APSCC 2008, Asia-Pacific Services Computing Conference, Yilan, Taiwan, December 2008
Abstract
Service Level Agreements (SLAs) is currently one of the
major research topics in Grid Computing. Among many
system components for the supporting of SLA-aware Gridbased
workflow, the SLA mapping module receives important
positions. Optimizing execution time is an important
task of the mapping module as it helps in finding out a feasible
solution when the Grid is busy or by eliminating the
negative effects of the error. With the previously proposed
algorithm for optimizing the execution time of the workflow,
the mapping module may, when many requests come in a
short period of time, become the bottleneck of the system.
This paper presents a parallel mapping algorithm for optimizing
the execution time of the workflow, which can cope
with the problem. Performance measurements deliver evaluation
results on the quality of the method.
Language
English
URI
http://hdl.handle.net/10371/6793
Files in This Item:
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Program in Technology, Management, Economics and Policy (협동과정-기술·경영·경제·정책전공)Others_협동과정-기술·경영·경제·정책전공
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse