By Topic

Optimizing the Execution Time of the SLA-based Workflow in the Grid 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
$33 $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 ; Jörn ALtmann ; Laurence T. Yang

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 Grid- based 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.

Published in:

Asia-Pacific Services Computing Conference, 2008. APSCC '08. IEEE

Date of Conference:

9-12 Dec. 2008