Mapping of SLA-based workflows with light communication onto Grid resources
| dc.contributor.author | Minh Quan, Dang | |
| dc.contributor.author | Altmann, Jörn | |
| dc.contributor.editor | Kowalczyk, Ryszard | |
| dc.date.accessioned | 2019-05-06T08:56:55Z | |
| dc.date.available | 2019-05-06T08:56:55Z | |
| dc.date.issued | 2007 | |
| dc.description.abstract | Service Level Agreements (SLAs) are currently one of the major research topics in Grid Computing. Among those system compo- nents that support SLA-aware Grid jobs, the SLA mapping mechanism has an important position. It is responsible for assigning sub-jobs of the workflow to Grid resources in a way that meets the user’s deadline and minimizes costs. Assuming many different kinds of sub-jobs and resources, the process of mapping an SLA-based workflow with light communication defines an unfamiliar and difficult problem. This paper presents a solution to this problem. The quality and efficiency of the algorithm is validated through performance measurements. | en |
| dc.identifier.isbn | 978-3-88579-211-6 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/22145 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e. V. | |
| dc.relation.ispartof | Grid service engineering and management – the 4th international conference on grid service engineering and management – GSEM 2007 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-117 | |
| dc.title | Mapping of SLA-based workflows with light communication onto Grid resources | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 145 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 135 | |
| gi.conference.date | September 25 - 26, 2007 | |
| gi.conference.location | Leipzig | |
| gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1