Resource Allocation Algorithm for the Light Communication Grid-Based Workflows within an SLA Context

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 work ow, the SLA mapping mechanism receives a prominent position. It is responsible for assigning sub-jobs of the work ow to Grid resources in a way that meets the user's deadline and minimizes costs. Assuming many dierent kinds of sub-jobs and resources, the process of mapping a light communication work ow within an SLA context denes an unfamiliar and dicult problem. This paper presents a mapping algorithm, which can cope with this problem. The quality and eciency of the algorithm is demonstrated through performance measurements