Cloud Computing refers to the use of the computing capabilities of remote computers, where the user has considerable computing power without having powerful units. Scientific applications, usually represented as Directed Acyclic Graphs (DAGs), are an important class of applications that lead to challenging problems for resource management in distributed computing. With the advent of Cloud Computing, particularly the IaaS offers for on demand virtual machines leasing, multiple jobs execution, consisting of a large number of DAGs, needs an elaborated scheduling and resource provisioning policies, for efficient use of resources. Only few works exists that consider this problem in the context of clouds environment. In goal of optimization and fault tolerance, DAGs applications are generally partitioned into multiple parallel DAGs using clustering algorithm and assigned to VM (Virtual Machine) resources independently. In this work, we investigate through simulation, the impact of clustering for both provisioning and scheduling policies in the total makespan and financial costs for execution of user's application. We implemented four scheduling policies well-known in grid computing systems, and adapted clustering algorithm to our resource management policy that leases and destroys dynamically VMs. We show that dynamic policies can achieve equal or even better performance than static management policies.
A dynamic programming approach to manage virtual machines allocation in cloud computing