Abstract
Dominant resource fairness (DRF) is a popular mechanism for multi-resource allocation in cloud computing systems. In this paper, we consider the problem of multi-resource fair allocation with bounded number of tasks. We propose the lexicographically max-min normalized share (LMMNS) fair allocation mechanism, which is a natural generalization of DRF, and design a non-trivial optimal algorithm to find a LMMNS fair allocation, whose running time is linear in the number of users. Then, we prove that LMMNS satisfies envy-freeness and group strategy-proofness, and analyze the approximation ratios of LMMNS with some assumptions, by exploiting the properties of the optimal solution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bertsimas, D., Farias, V.F., Trichakis, N.: The price of fairness. Oper. Res. 59(1), 17–31 (2011)
Bhattacharya, A.A., Culler, D., Friedman, E., Ghodsi, A., Shenker, S., Stoica, I.: Hierarchical scheduling for diverse datacenter workloads. In: Proceedings of the 4th Annual Symposium on Cloud Computing, SOCC 2013 (2013). Article No. 4
Blum, M., Floyd, R.W., Pratt, V., Rivest, R.R., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448–461 (1973)
Bonald, T., Roberts, J.: Enhanced cluster computing performance through proportional fairness. Perform. Eval. 79, 134–145 (2014)
Bonald, T., Roberts, J.: Multi-resource fairness: objectives, algorithms and performance. In: Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 31–42 (2015)
Dolev, D., Feitelson, D.G., Halpern, J.Y., Kupferman, R., Linial, N.: No justified complaints: on fair sharing of multiple resources. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS 2012, pp. 68–75 (2012)
Friedman, E., Ghodsi, A., Psomas, C.-A.: Strategyproof allocation of discrete jobs on multiple machines. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, pp. 529–546 (2014)
Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S., Stoica, I.: Dominant resource fairness: fair allocation of multiple resource types. In: Proceedings of the 8th USENIX Conference on Networked Systems Design and Implementation, NSDI 2011, pp. 24–24 (2011)
Gutman, A., Nisan, N.: Fair allocation without trade. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2012, pp. 719–728 (2012)
Kash, I., Procaccia, A., Shah, N.: No agent left behind: dynamic fair division of multiple resources. J. Artif. Intell. Res. 51, 351–358 (2014)
Li, W., Liu, X., Zhang, X., Zhang, X.: Dynamic fair allocation of multiple resources with bounded number of tasks in cloud computing systems. Multiagent Grid Syst. Int. J. 11, 245–257 (2015)
Li, W., Liu, X., Zhang, X., Zhang, X.: A further analysis of the dynamic dominant resource fairness mechanism. In: Xiao, M., Rosamond, F. (eds.) FAW 2017. LNCS, vol. 10336, pp. 163–174. Springer, Cham (2017). doi:10.1007/978-3-319-59605-1_15
Liu, H., He, B.: F2C: enabling fair and fine-grained resource sharing in multi-tenant IaaS clouds. IEEE Trans. Parallel Distrib. Syst. 27(9), 2589–2602 (2016)
Megiddo, N.: Optimal flows in networks with multiple sources and sinks. Math. Program. 7(3), 97–107 (1974)
Parkes, D.C., Procaccia, A.D., Shah, N.: Beyond dominant resource fairness: extensions, limitations, and indivisibilities. ACM Trans. Econ. Comput. 3(1) (2015). Article No. 3
Procaccia, A.D.: Cake cutting: not just child’s play. Commun. ACM 56(7), 78–87 (2013)
Tan, J., Zhang, L., Li, M., Wang, Y.: Multi-resource fair sharing for multiclass workflows. ACM SIGMETRICS Perform. Eval. Rev. 42(4), 31–37 (2015)
Tang, S., Niu, Z., Lee, B., He, B.: Multi-resource fair allocation in pay-as-you-go cloud computing. Manuscript (2014)
Wang, W., Liang, B., Li, B.: Multi-resource fair allocation in heterogeneous cloud computing systems. IEEE Trans. Parallel Distrib. Syst. 26(10), 2822–2835 (2015)
Wong, C.J., Sen, S., Lan, T., Chiang, M.: Multi-resource allocation: fairness efficiency tradeoffs in a unifying framework. IEEE/ACM Trans. Netw. 21(6), 1785–1798 (2013)
Zahedi, S.M., Lee, B.C.: REF: resource elasticity fairness with sharing incentives for multiprocessors. In: Proceedings of the 19th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pp. 145–160 (2014)
Zarchy, D., Hay, D., Schapira, M.: Capturing resource tradeoffs in fair multi-resource allocation. In: IEEE INFOCOM, pp. 1062–1070 (2015)
Zeldes, Y., Feitelson, D.G.: On-line fair allocations based on bottlenecks and global priorities. In: Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering, ICPE 2013, pp. 229–240 (2013)
Acknowledgment
The work is supported in part by the National Natural Science Foundation of China [Nos. 61662088, 11301466], the Natural Science Foundation of Yunnan Province of China [No. 2014FB114] and IRTSTYN.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Li, W., Liu, X., Zhang, X., Zhang, X. (2017). Multi-resource Fair Allocation with Bounded Number of Tasks in Cloud Computing Systems. In: Du, D., Li, L., Zhu, E., He, K. (eds) Theoretical Computer Science. NCTCS 2017. Communications in Computer and Information Science, vol 768. Springer, Singapore. https://doi.org/10.1007/978-981-10-6893-5_1
Download citation
DOI: https://doi.org/10.1007/978-981-10-6893-5_1
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-6892-8
Online ISBN: 978-981-10-6893-5
eBook Packages: Computer ScienceComputer Science (R0)