IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v31y2021i2ne2092.html
   My bibliography  Save this article

K‐PSO: An improved PSO‐based container scheduling algorithm for big data applications

Author

Listed:
  • Bo Liu
  • Jiawei Li
  • Weiwei Lin
  • Weihua Bai
  • Pengfei Li
  • Qian Gao

Abstract

In recent years, Docker container technology is being applied in the field of cloud computing at an explosive speed. The scheduling of Docker container resources has gradually become a research hotspot. Existing big data computing and storage platforms apply with traditional virtual machine technology, which often results in low resource utilization, a long time for flexible scaling and expanding clusters. In this paper, we propose an improved container scheduling algorithm for big data applications named Kubernetes‐based particle swarm optimization(K‐PSO). Experimental results show that the proposed K‐PSO algorithm converges faster than the basic PSO algorithm, and the running time of the algorithm is cut in about half. The K‐PSO container scheduling algorithm and algorithm experiment for big data applications are implemented in the Kubernetes container cloud system. Our experimental results show that the node resource utilization rate of the improved scheduling strategy based on K‐PSO algorithm is about 20% higher than that of the Kube‐scheduler default strategy, balanced QoS priority strategy, ESS strategy, and PSO strategy, while the average I/O performance and average computing performance of Hadoop cluster are not degraded.

Suggested Citation

  • Bo Liu & Jiawei Li & Weiwei Lin & Weihua Bai & Pengfei Li & Qian Gao, 2021. "K‐PSO: An improved PSO‐based container scheduling algorithm for big data applications," International Journal of Network Management, John Wiley & Sons, vol. 31(2), March.
  • Handle: RePEc:wly:intnem:v:31:y:2021:i:2:n:e2092
    DOI: 10.1002/nem.2092
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.2092
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nem.2092?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:intnem:v:31:y:2021:i:2:n:e2092. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.