IDEAS home Printed from https://ideas.repec.org/a/igg/jitwe0/v17y2022i1p1-17.html
   My bibliography  Save this article

MHDNNL: A Batch Task Optimization Scheduling Algorithm in Cloud Computing

Author

Listed:
  • Qirui Li

    (Guangdong University of Petrochemical Technology, China)

  • Zhiping Peng

    (Jiangmen Polytechnic, China)

  • Delong Cui

    (Guangdong University of Petrochemical Technology, China)

  • Jianpeng Lin

    (South China University of Technology, China)

  • Jieguang He

    (Guangdong University of Petrochemical Technology, China)

Abstract

Task optimization scheduling is one of the key concerns of both cloud service providers (CSPs) and cloud users. The CSPs hope to reduce the energy consumption of executing tasks to save costs, while the users are more concerned about shorter task completion time. In cloud computing, multi-queue and multi-cluster (MQMC) is a common resource configuration mode, and batch is a common task commission mode. The task scheduling (TS) in these modes is a multi-objective optimization (MOO) problem, and it is difficult to get the optimal solution. Therefore, the authors proposed a MOO scheduling algorithm for this model based on multiple heterogeneous deep neural networks learning (MHDNNL). The proposed algorithm adopts a collaborative exploration mechanism to generate the samples and use the memory replay mechanism to train. Experimental results show that the proposed algorithm outperforms the benchmark algorithms in minimizing energy consumption and task latency.

Suggested Citation

  • Qirui Li & Zhiping Peng & Delong Cui & Jianpeng Lin & Jieguang He, 2022. "MHDNNL: A Batch Task Optimization Scheduling Algorithm in Cloud Computing," International Journal of Information Technology and Web Engineering (IJITWE), IGI Global, vol. 17(1), pages 1-17, January.
    • Handle: RePEc:igg:jitwe0:v:17:y:2022:i:1:p:1-17
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJITWE.310053
    Download Restriction: no
    ---><---

    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:igg:jitwe0:v:17:y:2022:i:1:p:1-17. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.