skip to main content
10.1145/3290480.3290507acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiccnsConference Proceedingsconference-collections
research-article

Research on Kubernetes' Resource Scheduling Scheme

Authors Info & Claims
Published:02 November 2018Publication History

ABSTRACT

Currently, Google's open source container orchestration tool Kubernetes (K8s for short) has become the standard of fact for deploying containerized applications on a large scale in private, public, and hybrid cloud environments. By studying the scheduling-module of K8s source code, this paper finds that when selecting node for Pod, the module only considers the current optimal node, regardless of the use of resource costs. In order to solve this problem, this paper firstly realizes the model extraction of its scheduling module, and designs and implements the simulation experiment for the model for the first time. Secondly, a large number of papers on cloud computing resource scheduling are read. In this paper, the K8s scheduling model is improved by combining ant colony algorithm and particle swarm optimization algorithm. Finally, it is scored, and the node with the smallest objective function is selected to deploy the Pod. This paper draws on the resource scheduling model of CloudSim tool and implements resource scheduling of K8s using Java language. The experimental results show that the proposed algorithm is better than the original scheduling algorithm, which reduces the total resource cost and the maximum load of the node, and makes the task assignment more balanced.

References

  1. Xu Kai. Design and Implementation of A Scalable Dstributed Resource Scheduler Based on Kubernetes{D}.XIDIAN UNIVERSITY. 2017.Google ScholarGoogle Scholar
  2. Pengfei Yang. Research and Implementation of Dynamic Reaource Scheduling Based on Kubernetes{D}, 2017.Google ScholarGoogle Scholar
  3. Tang Rui. Research on Resources Scheduling Strategy of Container Cloud Platform Based on Kubernetes{D}.University of Electronic Science and Technology of China, 2017.Google ScholarGoogle Scholar
  4. ZOU YanfeiLIU Shuying. ResourcesScheduling Model of Cloud Computing Based on Improved Ant Colony Algorithm{J}.Journal of JilinUniversity. 2017, 55(03):679--683.Google ScholarGoogle Scholar
  5. ZHAO Jun-pu, YIN Jin-yong, JIN Tong-biao, ZENG Wei-ni. Application of genetic ant colony algorithm computing resource scheduling {J}.COMPUTER ENGINEERING AND DESIGN. 2017, 38(03):693--697.Google ScholarGoogle Scholar
  6. SA Rina. Cloud Computing Resource Scheduling Scheme Based on Ant Colony Particle Swarm OptimizationAlgorithm{J}. Journal of Jilin University. 2017, 55(06):1518--152.Google ScholarGoogle Scholar
  7. Qing Wang, Xueliang Fu, Gaifang Dong, ShashaZhao. Research on Particle Swarm Optimization Algorithm for Solving Cloud Computing Task Scheduling{J}.Computer Science and Application. 2018, 8(03), 286--295.Google ScholarGoogle ScholarCross RefCross Ref
  8. C Kaewkasi, K Chuenmuneewong. Improvement of container scheduling for Docker using Ant Colony Optimization{C}.International Conference on Knowledge & Smart Technology. 2017:254--259.Google ScholarGoogle Scholar
  9. NIE Qing-bin, CAITing, WANG Ning. Application of improved ant colony algorithm in resource allocation of cloud computing{J}, COMPUTER ENGINEERING AND DESIGN. 2016, 37(08):2016--2020.Google ScholarGoogle Scholar
  10. Du Heng-ji, LiYong. Research on Affect Performance of Parameter Setting in Ant Colony Algorithm{J}. Modern Computer. 2012(13):3--7.Google ScholarGoogle Scholar

Index Terms

  1. Research on Kubernetes' Resource Scheduling Scheme

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      ICCNS '18: Proceedings of the 8th International Conference on Communication and Network Security
      November 2018
      166 pages
      ISBN:9781450365673
      DOI:10.1145/3290480

      Copyright © 2018 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 2 November 2018

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader