SHERP

Mapping of SLA-Based Workflows with Light Communication onto Grid Resources

Cited 0 time in webofscience Cited 0 time in scopus
Authors
Quan, Dang Minh; Altmann, Jorn
Issue Date
2007-09
Publisher
GSEM 2007
Citation
GSEM 2007, 4th International Conference on Grid Service Engineering and Management, Leipzig, Germany, September 2007
Abstract
Service Level Agreements (SLAs) are currently one of the
major research topics in Grid Computing. Among those system compo-
nents that support SLA-aware Grid jobs, the SLA mapping mechanism
has an important position. It is responsible for assigning sub-jobs of
the work
ow to Grid resources in a way that meets the user's dead-
line and minimizes costs. Assuming many dierent kinds of sub-jobs and
resources, the process of mapping an SLA-based work
ow with light
communication denes an unfamiliar and dicult problem. This paper
presents a solution to this problem. The quality and eciency of the
algorithm is validated through performance measurements.
Language
English
URI
http://hdl.handle.net/10371/6829
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