Resource Allocation Algorithm For Light Communication Grid-based Workflows Within An Sla Context

摘要

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.