Minimizing Energy Consumption Scheduling Algorithm of Workflows With Cost Budget Constraint on Heterogeneous Cloud Computing Systems

Cloud computing is a promising platform to conduct large-scale workflow applications according to the pay-per-use model. Minimizing the energy consumption of precedence constrained workflows with cost budget constraints has become one of the popular topics in cloud data centers. Most existing scheduling algorithms mainly consider execution time or cost of a given workflow application under a budget constraint; however, these algorithms do not adequately consider energy saving. A reducing energy consumption strategy using a critical task remapping (RMREC) algorithm is proposed in this study. This algorithm is decomposed into two phases: energy consumption reduction and critical task remapping. In the first phase, the adjustable cost budget and spare cost are determined on the basis of cost budget, critical task path, and adjustable budget factor. All workflow tasks are further allocated to virtual machines (VMs) with the lowest energy consumption to achieve preliminary mapping between tasks and VMs while satisfying the adjustable cost budget constraint. In the second phase, critical tasks are remapped to VMs according to spare cost to decrease energy consumption caused by task migration. Experiments on two types of workflow applications with different scales demonstrate that the presented RMREC algorithm effectively reduces energy consumption without violating cost budget constraints compared with existing algorithms.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.