Publications
Detailed Information
Optimizing the Execution Time of the SLA-Based Workflow in the Grid with Parallel Processing Technology
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Quan, Dang Minh | - |
dc.contributor.author | Altmann, Jorn | - |
dc.contributor.author | Yang, Laurence T. | - |
dc.date.accessioned | 2009-08-10T06:25:57Z | - |
dc.date.available | 2009-08-10T06:25:57Z | - |
dc.date.issued | 2008-12 | - |
dc.identifier.citation | IEEE APSCC 2008, Asia-Pacific Services Computing Conference, Yilan, Taiwan, December 2008 | en |
dc.identifier.uri | https://hdl.handle.net/10371/6793 | - |
dc.description.abstract | 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 Gridbased 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. | en |
dc.language.iso | en | en |
dc.publisher | IEEE APSCC 2008 | en |
dc.title | Optimizing the Execution Time of the SLA-Based Workflow in the Grid with Parallel Processing Technology | en |
dc.type | Conference Paper | en |
- Appears in Collections:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.