A Survey of the State-of-the-Art in Fair Multi-Resource Allocations for Data Centers

被引:40
作者
Poullie, Patrick [1 ]
Bocek, Thomas [1 ]
Stiller, Burkhard [1 ]
机构
[1] Univ Zurich, Dept Informat, Commun Syst Grp, CH-8050 Zurich, Switzerland
来源
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT | 2018年 / 15卷 / 01期
关键词
Multi-resource allocations; fairness; utility functions; data centers; cloud; greediness metric fairness; EFFICIENCY TRADEOFFS;
D O I
10.1109/TNSM.2017.2743066
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multi-resource allocation in data centers determines a network and service management task of crucial importance. While, traditionally computing systems are shared based on a single resource, it was shown that in data centers this simplification often impedes overall efficiency and fairness. Therefore, newer approaches consider data center resource allocations as a multi-resource allocation problem. However, the capability of these approaches to reach overall fairness or efficiency is limited due to theoretical assumptions they make or due to practical means they deploy to control resources. This survey: 1) details all steps necessary to allocate data center resources and puts these steps in relation to each other; 2) highly relevant concepts in support of fair data center resource allocations, such as utility functions and allocation characteristics, are discussed and compared; and 3) in turn, major approaches to allocate multiple data center resources in a fair manner are outlined, mapped to practical steps and economically driven-targets, and compared with respect to their suitability of being applied in today's data centers.
引用
收藏
页码:169 / 183
页数:15
相关论文
共 66 条
[21]  
Dolev D., 2012, proceedings of the 3rd Innovations in Theoretical Computer Science Conference, P68
[22]  
Ferguson D.F., 1996, MARKET BASED CONTROL, P156
[23]  
Floyd S., 2008, RFC5166,
[24]  
Friedman Eric., 2014, P 15 ACM C EC COMPUT, P529
[25]  
Ghodsi A., 2013, 8 EUR C 2013 EUROSYS, P365
[26]   Multi-Resource Fair Queueing for Packet Processing [J].
Ghodsi, Ali ;
Sekar, Vyas ;
Zaharia, Matei ;
Stoica, Ion .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2012, 42 (04) :1-12
[27]   Multi-Resource Packing for Cluster Schedulers [J].
Grandl, Robert ;
Ananthanarayanan, Ganesh ;
Kandula, Srikanth ;
Rao, Sriram ;
Akella, Aditya .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2014, 44 (04) :455-466
[28]  
Gutman A., 2012, P 11 INT C AUT AG MU, V2, P719
[29]  
Hindman B., 2011, Mesos: a platform for fine-grained resource sharing in the data center, P295
[30]   Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints [J].
Im, Sungjin ;
Kulkarni, Janardhan ;
Munagala, Kamesh .
STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, :313-322