SHERP

Mapping Heavy Communication SLA-based Workflows onto Grid Resources 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-09
Publisher
HPCC 2008
Citation
HPCC 2008, Conference on High Performance Computing and Communications, Dalian, China, September 2008
Abstract
Service Level Agreements (SLAs) are currently one of the
major research topics in Grid Computing. Amongmany system
components for supporting of SLA-aware Grid jobs, the
SLA mapping module holds an important position and the
capability of the mapping module depends on the runtime of
the mapping algorithm. With the previously proposed mapping
algorithm, the mapping module may develop into the
bottleneck of the system if many requests come in during a
short period of time. This paper presents a parallel mapping
algorithm to map heavy communication SLA-based
workflow onto Grid resources which can cope with the problem.
Performance measurements thereby deliver evaluation
results showing the quality of the method.
Language
English
URI
http://hdl.handle.net/10371/6801
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