Fair multiple-workflow scheduling with different quality-of-service goals

Journal Article (2019)
Author(s)

Amin Rezaeian (Ferdowsi University of Mashhad)

Mahmoud Naghibzadeh (Ferdowsi University of Mashhad)

D.H.J. Epema (TU Delft - Data-Intensive Systems)

Research Group
Data-Intensive Systems
Copyright
© 2019 Amin Rezaeian, Mahmoud Naghibzadeh, D.H.J. Epema
DOI related publication
https://doi.org/10.1007/s11227-018-2604-2
More Info
expand_more
Publication Year
2019
Language
English
Copyright
© 2019 Amin Rezaeian, Mahmoud Naghibzadeh, D.H.J. Epema
Research Group
Data-Intensive Systems
Issue number
2
Volume number
75
Pages (from-to)
746-769
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Cloud schedulers that allocate resources exclusively to single workflows are not work-conserving as they may be forced to leave gaps in their schedules because of the precedence constraints in the workflows. Thus, they may lead to a waste of financial resources. This problem can be mitigated by multiple-workflow schedulers that share the leased cloud resources among multiple workflows or users by filling the gaps left by one workflow with the tasks of other workflows. This solution may even work when users have different performance objectives for their workflows, such as budgets and deadlines. As an additional requirement, we want the scheduler to be fair to all workflows regardless of their performance objectives. In this paper, we propose a multiple-workflow scheduler that is able to target different quality of service goals for different workflows and that considers fairness among different users. To this aim, we propose an unfairness metric and four workflow selection policies. We prove that the resource selection that decides based on a task’s sub-budget, sub-deadline, finish time, and cost on different resources is selecting the best resource based on the given information, while using the smallest number of calculations. Simulations show that there is a trade-off between overall cost, makespan, and fairness. We conclude that the best workflow selection policy to reduce unfairness is the direct policy, which explicitly selects the workflow that minimizes the value of the proposed unfairness metric in each round.

Files

JournalofSupercomputing_Rezaei... (pdf)
(pdf | 0.935 Mb)
- Embargo expired in 12-09-2019
License info not available