By Topic

Mapping Heavy Communication SLA-Based Workflows onto Grid Resources with Parallel Processing Technology

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Dang Minh Quan ; Sch. of Inf. Technol., Int. Univ. in Germany, Bruchsal ; Altmann, J. ; Yang, L.T.

Service level agreements (SLAs) are currently one of the major research topics in grid computing. Among many 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.

Published in:

High Performance Computing and Communications, 2008. HPCC '08. 10th IEEE International Conference on

Date of Conference:

25-27 Sept. 2008