Browse
S-Space
College of Engineering/Engineering Practice School (공과대학/대학원)
Program in Technology, Management, Economics and Policy (협동과정-기술·경영·경제·정책전공)
Others_협동과정-기술·경영·경제·정책전공
Mapping Light 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:27:12Z | - |
dc.date.available | 2009-08-10T06:27:12Z | - |
dc.date.issued | 2008-12 | - |
dc.identifier.citation | IEEE ISPA 2008, International Symposium on Parallel and Distributed Parallel Processing with Application, Sydney, Australia, December 2008 | en |
dc.identifier.uri | http://hdl.handle.net/10371/6794 | - |
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-based workflows, the SLA mapping module receives an important position. Mapping light communication workflows is one main part of the mapping module. With the previously proposed mapping algorithm, the mapping module may become the bottleneck of the system when many requests come in a short period of time. This paper presents a parallel mapping algorithm for light communication SLA-based workflows, 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 ISPA 2008 | en |
dc.title | Mapping Light Communication SLA-Based Workflows onto Grid Resources with Parallel Processing Technology | en |
dc.type | Conference Paper | en |
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.