Mapping Heavy Communication Grid-Based Workflows Onto Grid Resources Within an SLA Context Using Metaheuristics
Authors:
- 1 August 2008
- journal article
- research article
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 22 (3) , 330-346
Abstract
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.Keywords
This publication has 29 references indexed in Scilit:
- Multiple states based temporal consistency for dynamic verification of fixed-time constraints in Grid workflow systemsConcurrency and Computation: Practice and Experience, 2006
- Grid load balancing using intelligent agentsFuture Generation Computer Systems, 2005
- Scheduling Algorithms2004
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- A genetic algorithm for multiprocessor schedulingIEEE Transactions on Parallel and Distributed Systems, 1994
- A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessorsJournal of Parallel and Distributed Computing, 1992
- C.P.M. Scheduling with Small Communication Delays and Task DuplicationOperations Research, 1991
- Tabu Search—Part IIINFORMS Journal on Computing, 1990
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- A comparison of list schedules for parallel processing systemsCommunications of the ACM, 1974