SHERP

Resource Allocation Algorithm for the Light Communication Grid-Based Workflows within an SLA Context

Cited 0 time in webofscience Cited 12 time in scopus
Authors
Quan, Dang Minh; Altmann, Jorn
Issue Date
2009-02
Publisher
Taylor & Francis
Citation
International Journal of Parallel, Emergent and Distributed Systems, 24, 31-48
Keywords
Grid computinglight communication workmappingService Level Agreement
Abstract
Service Level Agreements (SLAs) are currently one of the major research topics in Grid Computing.
Among many system components for supporting SLA-aware Grid-based work
ow, the SLA mapping
mechanism receives a prominent position. It is responsible for assigning sub-jobs of the work
ow to
Grid resources in a way that meets the user's deadline and minimizes costs. Assuming many dierent
kinds of sub-jobs and resources, the process of mapping a light communication work
ow within an
SLA context denes an unfamiliar and dicult problem. This paper presents a mapping algorithm,
which can cope with this problem. The quality and eciency of the algorithm is demonstrated
through performance measurements
ISSN
1744-5760 (print)
1744-5779 (online)
Language
English
URI
http://hdl.handle.net/10371/6790
DOI
https://doi.org/10.1080/17445760802225868
Files in This Item:
There are no files associated with this item.
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Program in Technology, Management, Economics and Policy (협동과정-기술·경영·경제·정책전공)Journal Papers (저널논문_협동과정-기술·경영·경제·정책전공)
  • mendeley

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

Browse