Resource allocation algorithm for light communication grid-based workflows within an SLA context

Authors:
Minh Quan Dang;Jorn Altmann
Affiliations:
School of Information Technology, International University in Germany, Bruchsal, Germany;School of Information Technology, International University in Germany, Bruchsal, Germany
Venue:
International Journal of Parallel, Emergent and Distributed Systems
Year:
2009

Citing 18
Cited 6

Scheduling parallel program tasks onto arbitrary target machines

Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Algorithms for constraint-satisfaction problems: a survey

AI Magazine
Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem

Artificial Intelligence
Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems

Journal of the ACM (JACM)
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
Grain Size Determination for Parallel Processing

IEEE Software
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
Scheduling Algorithms

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
Scheduling parameter sweep applications on global Grids: a deadline and budget constrained cost-time optimization algorithm

Software—Practice & Experience
Error recovery mechanism for grid-based workflow within SLA context

International Journal of High Performance Computing and Networking
Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms

Scientific Programming - Scientific Workflows
Approach by localization and multiobjective evolutionaryoptimization for flexible job-shop scheduling problems

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews

An SLA-based resource virtualization approach for on-demand service provision

VTDC '09 Proceedings of the 3rd international workshop on Virtualization technologies in distributed computing
VieSLAF Framework: Enabling Adaptive and Versatile SLA-Management

GECON '09 Proceedings of the 6th International Workshop on Grid Economics and Business Models
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
SLA enabled CARE resource broker

Future Generation Computer Systems
Joint Elastic Cloud and Virtual Network Framework for Application Performance-cost Optimization

Journal of Grid Computing
An interoperable and self-adaptive approach for SLA-based service virtualization in heterogeneous Cloud environments

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Service level agreements (SLAs) are currently one of the major research topics in grid computing. Among many system components for supporting SLA-aware grid-based workflow, the SLA mapping mechanism receives a prominent position. It is responsible for assigning sub-jobs of the workflow to grid resources in a way that meets the user's deadline and minimises costs. Assuming many different kinds of sub-jobs and resources, the process of mapping a light communication workflow within an SLA context defines an unfamiliar and difficult problem. This paper presents a mapping algorithm, which can cope with this problem. The quality and efficiency of the algorithm is demonstrated through performance measurements.