Scaling and Scheduling to Maximize Application Performance within Budget Constraints in Cloud Workflows

  title={Scaling and Scheduling to Maximize Application Performance within Budget Constraints in Cloud Workflows},
  author={Ming Mao and Marty Humphrey},
  journal={2013 IEEE 27th International Symposium on Parallel and Distributed Processing},
  • Ming Mao, M. Humphrey
  • Published 20 May 2013
  • Computer Science
  • 2013 IEEE 27th International Symposium on Parallel and Distributed Processing
It remains a challenge to provision resources in the cloud such that performance is maximized and financial cost is minimized. A fixed budget can be used to rent a wide variety of resource configurations for varying durations. The two steps - resource acquisition and scheduling/allocation - are dependent on each other and are particularly difficult when considering complex resource usage such as workflows, where task precedence need to be preserved and the budget constraint is assigned for the… 

Scheduling Workloads of Workflows in Clusters and Clouds

This dissertation proposes novel scheduling policies for workloads of workflows and investigates the applicability of relevant state-of-the-art policies to the online scenario to address three key challenges.

Budget-Aware Scheduling Algorithms for Scientific Workflows with Stochastic Task Weights on Heterogeneous IaaS Cloud Platforms

This paper introduces several budget-aware algorithms to deploy scientific workflows on IaaS cloud platforms, where users can request Virtual Machines (VMs) of different types, each with specific

A Budget-Aware Algorithm for Scheduling Scientific Workflows in Cloud

  • Vahid ArabnejadK. BubendorferBryan K. F. Ng
  • Computer Science
    2016 IEEE 18th International Conference on High Performance Computing and Communications; IEEE 14th International Conference on Smart City; IEEE 2nd International Conference on Data Science and Systems (HPCC/SmartCity/DSS)
  • 2016
A new Budget Aware Trickling (BAT) algorithm is introduced that addresses eScience workflow scheduling in the cloud by distributes budget based on the dependency structure inherent in workflows and it yields 30% reduction in makespan while maintaining consistent success rate.

Budget-aware scheduling algorithms for scientific workflows with stochastic task weights on IaaS Cloud platforms

This report, which is an update of [5], introduces several budget-aware algorithms to deploy scientific workflows on IaaS Cloud platforms, where users can request Virtual Machines (VMs) of different

A budget and deadline aware scientific workflow resource provisioning and scheduling mechanism for cloud

An elastic resource provisioning and task scheduling mechanism to perform scientific workflows in cloud to complete as many high-priority workflows as possible under budget and deadline constrains is designed.

Cost adaptive workflow scheduling in cloud computing

By using the proposed schemes, the heuristic based workflow scheduling scheme is able to reduce the number of required VM instances and achieve the significant cost saving while the user's SLA (Service Level Agreement) is guaranteed in terms of workflow deadline.

Budget‐aware scheduling algorithms for scientific workflows with stochastic task weights on infrastructure as a service Cloud platforms

This paper introduces several budget‐aware algorithms to deploy scientific workflows on Infrastructure as a Service Cloud platforms, and extends two well‐known algorithms, MinMin and HEFT, and make scheduling decisions based upon machine availability and remaining budget.

Budget-Driven Resource Provisioning and Scheduling of Scientific Workflow in IaaS Clouds with Fine-Grained Billing Periods

This work proposes a scheduling algorithm whose objective is to optimise a workflow’s execution time under a budget constraint; Quality of Service requirement that has been overlooked in favour of optimising cost under a deadline constraint; and addresses fundamental challenges of clouds such as resource elasticity, abundance, and heterogeneity.

HBDCWS: heuristic-based budget and deadline constrained workflow scheduling approach for heterogeneous clouds

A heuristic-based budget and deadline constrained workflow scheduling algorithm (HBDCWS) has been proposed to utilize those applications that have the budget and deadlines constraints and proves to be efficient for minimizing the makespan and reducing the cost of execution.

Budget distribution strategies for scientific workflow scheduling in commercial clouds

The Budget Distribution with Trickling (BDT) algorithm is introduced that presents new notions for distributing budget based on the dependency structure inherent in workflows and shows that biasing the budget distribution to the earlier computation within a workflow will generally produce a lower makespan within budget.



Auto-scaling to minimize cost and meet application deadlines in cloud workflows

  • Ming MaoM. Humphrey
  • Computer Science
    2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC)
  • 2011
This paper presents an approach whereby the basic computing elements are virtual machines (VMs) of various sizes/costs, jobs are specified as workflows, users specify performance requirements by assigning (soft) deadlines to jobs, and the goal is to ensure all jobs are finished within their deadlines at minimum financial cost.

Cost- and deadline-constrained provisioning for scientific workflow ensembles in IaaS clouds

It is found that the key factor determining the performance of an algorithm is its ability to decide which workflows in an ensemble to admit or reject for execution, and an admission procedure based on workflow structure and estimates of task runtimes can significantly improve the quality of solutions.

Cloud auto-scaling with deadline and budget constraints

This paper presents a cloud auto-scaling mechanism to automatically scale computing instances based on workload information and performance desire, and demonstrates that it can meet user specified performance goal with less cost.

Bag-of-Tasks Scheduling under Budget Constraints

  • Ana OprescuT. Kielmann
  • Computer Science
    2010 IEEE Second International Conference on Cloud Computing Technology and Science
  • 2010
The results show that BaTS is able to schedule within a user-defined budget (if such a schedule is possible at all), and significant cost savings can be achieved when comparing to a cost-oblivious round-robin scheduler.

Schedule optimization for data processing flows on the cloud

This paper studies scheduling of dataflows that involve arbitrary data processing operators in the context of three different problems and presents an approximate optimization framework to address them that uses resource elasticity in the cloud.

Cost-Optimal Scheduling in Hybrid IaaS Clouds for Deadline Constrained Workloads

This work analyzes and proposes a binary integer program formulation of the scheduling problem and finds that this approach results in a tractable solution for scheduling applications in the public cloud, but that the same method becomes much less feasible in a hybrid cloud setting due to very high solve time variances.

Scheduling Workflows with Budget Constraints

This paper considers a basic model for workflow applications modelled as Directed Acyclic Graphs (DAGs) and investigates heuristics that allow to schedule the nodes of the DAG (or tasks of a workflow) onto resources in a way that satisfies a budget constraint and is still optimized for overall time.

Cost-based scheduling of scientific workflow applications on utility grids

  • Jia YuR. BuyyaC. Tham
  • Computer Science
    First International Conference on e-Science and Grid Computing (e-Science'05)
  • 2005
This paper proposes a cost-based workflow scheduling algorithm that minimizes execution cost while meeting the deadline for delivering results and attempts to optimally solve the task scheduling problem in branches with several sequential tasks by modeling the branch as a Markov decision process and using the value iteration method.

A Multiple QoS Constrained Scheduling Strategy of Multiple Workflows for Cloud Computing

This paper introduces a Multiple QoS Constrained Scheduling Strategy of Multi-Workflows (MQMW) which can schedule multiple workflows which are started at any time and the QoS requirements are taken into account.

SLA-Based Resource Allocation for Software as a Service Provider (SaaS) in Cloud Computing Environments

  • Linlin WuS. GargR. Buyya
  • Computer Science
    2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing
  • 2011
This paper proposes resource allocation algorithms for SaaS providers who want to minimize infrastructure cost and SLA violations, designed in a way to ensure that Saas providers are able to manage the dynamic change of customers, mapping customer requests to infrastructure level parameters and handling heterogeneity of Virtual Machines.