Skip to main content
SpringerLink
Log in

No user left behind: dynamic bottleneck-aware allocation of multiple resources

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

The fast-developing of cloud computing causes the resource management to the hot and heat research. Some researcher have studied the resource allocation and proposed some resource allocation mechanisms in the cloud computing, such as max–min fairness that is used in the data center. In order to satisfy the demand of cloud computing, we need to design a efficient and fair resource allocation mechanism. Wang et al. (Proceedings of the USENIX Conference on File and Storage Technologies (FAST), 229–242, 2014) proposed a new resource allocation mechanism, called balancing fairness and efficiency with bottleneck-aware allocation (BAA). BAA aims to find the fair between the users and maximize the resource utilization. However, BAA only consider the two resource types and the resource pool may have multiple resource types such as CPU, memory and storage. In addition, BAA consider the static allocation and do not take into account the dynamic allocation of users join the system one by one. To over this drawback, we propose the bottleneck-aware allocation of multiple resources (MRBAA) and dynamic bottleneck-aware allocation (DBBA) fair allocation mechanism. MRBAA and DBBA have lots of good properties. In addition, we characterizes the properties of our proposed mechanisms. Furthermore, our proposed mechanisms achieves the multiple resources fair and dynamic allocation to become more adaptable the real-world scenarios. Compared with the existing popular mechanism dominant resource fairness (DRF) from the literature, the simulation results show that our proposed mechanisms can efficient use of heterogeneous resources, increase multiple resources utilization, and schedule more tasks to benefit users.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Ambrust, M., Fox, A., Griffith R.: above the clouds: A Berkeley view of cloud computing [EB/OL].(2011-01-25). http://www.eecs.berkeley.edu/pubs/ techrpts/2009/EECS-2009-28.pdf

  2. Isard, M., Budiu, M., Yu, Y., Birrell, A., Fetterly, D.: Dryad: distributed data-parallel programs from sequential building blocks. Eng. Anal. 32(1), 67–75 (2007)

    Google Scholar 

  3. 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’11, pp. 24, (2011)

  4. Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Comput. Sci. 26(2), 467–475 (2004)

    MathSciNet  Google Scholar 

  5. Hindman, B., Konwinski, A., Zahria, M., Ghodis, A., Joseph, A.D., Katz, R., Shenker, S., Stoica, I.: Mesos: a platform for fine-grained resource sharing in the data center. NSDI 2011, 78–87 (2011)

    Google Scholar 

  6. Ghodsi, A., Zaharia, M., Shenker, S., Stoica, I.: Choosy: max–min fair sharing for datacenter jobs with constraints. Comput. Sci. 32(4), 124–135 (2013)

    Google Scholar 

  7. Isard, M., Prabhakaran, V., Currey, J., Wieder, U., Talwar, K., Goldberg, A.: Fair scheduling for distributed computing clusters. Storage Technol. 16(2), 261–276 (2009)

    Google Scholar 

  8. Zaharia, M., Chowdhury, M., Franklin, J., Shenker, S., Stoica, I.S.: Cluster computing with working sets. HotCloud 35(10), 10–16 (2010)

    Google Scholar 

  9. Wang, H., Varman, P.J.: Balancing fairness and efficiency in tiered storage system with bottleneck-aware allocation. In: Proceedings of the USENIX Conference on File and Storage Technologies (FAST), 229–242 (2014)

  10. Ian, K., Ariel, D.P., Nisarg, S.: No agent left behind: dynamic fair division of multiple resources. J. Artif. Intel. Res. 51(2), 579–603 (2014)

    MathSciNet  MATH  Google Scholar 

  11. Danny, D., Dror, G., Feitelson, J.Y., Halpern, R.K., Nathan, L.: No justified complaints: on fair sharing of multiple resources. In: proceedings of the 3rd Innovations in Theoretical Computer Science Conference, 12, pp. 68–75, (2012)

  12. Joe, W.C., Sen, S., Lan, T., Chiang, M.: Multi-resource allocation: fairness efficiency tradeoffs in a unifying framework. In: 31st Annual International Conference on Computer Communications (IEEE INFOCOM), 1206–1214 (2012)

  13. Gutman, A., Nisan, N.: Fair allocation without trade. In: International Conference on Autonomous Agents and Multiagent Systems. International Foundation for Autonomous Agents and Multiagent Systems, 719–728 (2012)

  14. Liu, H., He, B.: Reciprocal resource fairness: towards cooperative multiple-resource fair sharing in IaaS clouds. In: International Conference for High PERFORMANCE Computing, Networking, Storage and Analysis, 970–981 (2014)

  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 (2015)

    Article  Google Scholar 

  16. Zarchy, D., Hay, D., Schapira, M .:Capturing resource tradeoffs in fair multi-resource allocation. In: IEEE Conference on Computer Communications (INFOCOM), 1062–1070 (2015)

  17. Parkes, D.C., Procaccia, A.D., Shan, N.: Beyond dominant resource fairness: extensions, limitations, and indivisibilities. ACM Trans. Econ. Comput. 3(1), 3 (2015)

    Article  MathSciNet  Google Scholar 

  18. Liu, X., Zhang, X., Zhang, X et al.: Dynamic fair division of multiple resources with satiable agents in cloud computing systems. In: IEEE Fifth International Conference on Big Data and Cloud Computing. IEEE Computer Society, 131–136 (2015)

  19. Psomas, C-A., Schwartz, J.: Strategyproof allocation of discrete: indivisible resource allocation in clusters. Tech Report Berkeley (2013)

  20. 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, 529–546 (2014)

  21. Wang, L., Liang, B., Li, B.: Multi-resource fair allocation in heterogeneous cloud computing systems. IEEE Trans. Parallel Distrib. Syst. 26(10), 2822–2835 (2015)

    Article  Google Scholar 

  22. Liu, X., Zhang, X., Li, W. et al.: Discrete interior search algorithm for multi-resource fair allocation in heterogeneous cloud computing systems. In: Intelligent Computing Theories and Application. Springer, Berlin (2016)

  23. Zhu, Q., Oh, JC.: An approach to dominant resource fairness in distributed environment. In: Proceedings of the 28th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, 141–150 (2015)

Download references

Acknowledgements

The work was supported by Chinese Natural Science Foundation Grant No. 11361048. Yunnan Natural Science Foundation (2017) and Qujing Normal University Natural Science Foundation (ZDKC2016002).

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, Qujing Normal University, Qujing, 655011, People’s Republic of China

    Jun Liu

  2. College of Information Engineering, Qujing Normal University, Qujing, 655011, People’s Republic of China

    Chunyan Zhu

Authors
  1. Jun Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chunyan Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jun Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, J., Zhu, C. No user left behind: dynamic bottleneck-aware allocation of multiple resources. Cluster Comput 22 (Suppl 4), 10219–10227 (2019). https://doi.org/10.1007/s10586-017-1245-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-017-1245-1

Keywords

Search

Navigation