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

被引:10
作者
Rezaeian, Amin [1 ]
Naghibzadeh, Mahmoud [1 ]
Epema, Dick H. J. [2 ]
机构
[1] Ferdowsi Univ Mashhad, Fac Engn, Dept Comp Engn, Azadi Sq, Mashhad, Iran
[2] Delft Univ Technol, Fac EEMCS, Parallel & Distributed Syst Grp, NL-2628 CD Delft, Netherlands
关键词
Scheduling; Multiple workflows; Fairness; Budget-constrained workflow; Deadline-constrained workflow; TASKS;
D O I
10.1007/s11227-018-2604-2
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:746 / 769
页数:24
相关论文
共 27 条
[1]   LIGO - THE LASER-INTERFEROMETER-GRAVITATIONAL-WAVE-OBSERVATORY [J].
ABRAMOVICI, A ;
ALTHOUSE, WE ;
DREVER, RWP ;
GURSEL, Y ;
KAWAMURA, S ;
RAAB, FJ ;
SHOEMAKER, D ;
SIEVERS, L ;
SPERO, RE ;
THORNE, KS ;
VOGT, RE ;
WEISS, R ;
WHITCOMB, SE ;
ZUCKER, ME .
SCIENCE, 1992, 256 (5055) :325-333
[2]  
Abrishami S, 2010, P 11 IEEE ACM INT C
[3]   Deadline-constrained workflow scheduling algorithms for Infrastructure as a Service Clouds [J].
Abrishami, Saeid ;
Naghibzadeh, Mahmoud ;
Epema, Dick H. J. .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2013, 29 (01) :158-169
[4]   Montage: A grid enabled engine for delivering custom science-grade mosaics on demand [J].
Berriman, GB ;
Deelman, E ;
Good, J ;
Jacob, J ;
Katz, DS ;
Kesselman, C ;
Laity, A ;
Prince, TA ;
Singh, G ;
Su, MH .
OPTIMIZING SCIENTIFIC RETURN FOR ASTRONOMY THROUGH INFORMATION TECHNOLOGIES, 2004, 5493 :221-232
[5]  
Bessai K., 2012, 2012 IEEE 4th International Conference on Cloud Computing Technology and Science (CloudCom). Proceedings, P496, DOI 10.1109/CloudCom.2012.6427530
[6]  
Bharathi S, 2008, 2008 THIRD WORKSHOP ON WORKFLOWS IN SUPPORT OF LARGE-SCALE SCIENCE (WORKS 2008), P11
[7]  
Bittencourt L. F., 2005, 3 INT WORKSH MIDDL G
[8]   A performance-oriented adaptive scheduler for dependent tasks on grids [J].
Bittencourt, Luiz F. ;
Madeira, Edmundo R. M. .
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2008, 20 (09) :1029-1049
[9]   Towards the Scheduling of Multiple Workflows on Computational Grids [J].
Bittencourt, Luiz Fernando ;
Madeira, Edmundo R. M. .
JOURNAL OF GRID COMPUTING, 2010, 8 (03) :419-441
[10]  
Buyya R, 2009, LECT NOTES COMPUT SC, V5931, P24, DOI 10.1007/978-3-642-10665-1_4