Publications
Detailed Information
Mapping Heavy Communication SLA-based Workflows onto Grid Resources 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:42:34Z | - |
dc.date.available | 2009-08-10T06:42:34Z | - |
dc.date.issued | 2008-09 | - |
dc.identifier.citation | HPCC 2008, Conference on High Performance Computing and Communications, Dalian, China, September 2008 | en |
dc.identifier.uri | https://hdl.handle.net/10371/6801 | - |
dc.description.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. | en |
dc.language.iso | en | - |
dc.publisher | HPCC 2008 | en |
dc.title | Mapping Heavy Communication SLA-based Workflows onto Grid Resources 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.