MAPPING HEAVY COMMUNICATION GRID-BASED WORKFLOWS ONTO GRID RESOURCES WITHIN AN SLA CONTEXT USING METAHEURISTICS

摘要

Service Level Agreements (SLAs) are currently one of the major research topics in grid computing. Among many system components for SLA-related grid jobs, the SLA mapping mechanism has received widespread attention. It is responsible for assigning sub-jobs of a workflow to a variety of grid resources in a way that meets the user's deadline and costs as little as possible. With the distinguished workload and resource characteristics, mapping a heavy communication workflow within an SLA context gives rise to a complicated combinatorial optimization problem. This paper presents the application of various metaheuristics and suggests a possible approach to solving this problem. Performance measurements deliver evaluation results on the quality and efficiency of each method.