Scheduling parallel program tasks onto arbitrary target machines
Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Modern heuristic techniques for combinatorial problems
GSA: scheduling and allocation using genetic algorithm
EURO-DAC '94 Proceedings of the conference on European design automation
A fast taboo search algorithm for the job shop problem
Management Science
Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
Journal of the ACM (JACM)
The ant colony optimization meta-heuristic
New ideas in optimization
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
A comparison of list schedules for parallel processing systems
Communications of the ACM
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Declustering: A New Multiprocessor Scheduling Technique
IEEE Transactions on Parallel and Distributed Systems
A Genetic Algorithm for Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
Automated SLA Monitoring for Web Services
DSOM '02 Proceedings of the 13th IFIP/IEEE International Workshop on Distributed Systems: Operations and Management: Management Technologies for E-Commerce and E-Business Applications
Approximation Algorithms for Flexible Job Shop Problems
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Experiences with predicting resource performance on-line in computational grid settings
ACM SIGMETRICS Performance Evaluation Review
Scheduling Algorithms
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
An Advanced Tabu Search Algorithm for the Job Shop Problem
Journal of Scheduling
On Architecture for SLA-Aware Workflows in Grid Environments
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Grid load balancing using intelligent agents
Future Generation Computer Systems
Making the Grid Predictable through Reservations and Performance Modelling
The Computer Journal
QoS Support for Time-Critical Grid Workflow Applications
E-SCIENCE '05 Proceedings of the First International Conference on e-Science and Grid Computing
The virtual resource manager: an architecture for SLA-aware resource management
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Network-based resource allocation for Grid Computing within an SLA context
GCC '06 Proceedings of the Fifth International Conference on Grid and Cooperative Computing
Concurrency and Computation: Practice & Experience - Autonomous Grid Computing
Error recovery mechanism for grid-based workflow within SLA context
International Journal of High Performance Computing and Networking
SLA negotiation protocol for grid-based workflows
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
BPM'06 Proceedings of the 4th international conference on Business Process Management
Mapping workflows onto grid resources within an SLA context
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Virtual Resources Allocation for Workflow-Based Applications Distribution on a Cloud Infrastructure
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Joint Elastic Cloud and Virtual Network Framework for Application Performance-cost Optimization
Journal of Grid Computing
Deadline-constrained workflow scheduling algorithms for Infrastructure as a Service Clouds
Future Generation Computer Systems
| Hi-index | 0.00 |
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.