List-Based Task Scheduling Algorithm for Distributed Computing System Using Artificial Intelligence

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 941)


Job scheduling in DAG (Directed Acyclic Graph) workflow have been a challenging task for the last couple of years. In DAG there is no miner so the time required to search task according to CPU is less. If an appropriate scheduling technique is not selected it may result in an increase in task execution time which may further negatively affect the energy consumption. Energy Prevention is one of the hottest issues in present era which is affecting the global environment. The problem of this research work is to propose a scheduling algorithm in such a manner that the consumption of energy for a DAG G (a, b), on the completion of all jobs is least. In this paper, an energy optimization model with the concept of task scheduling in cloud computing is proposed. List based HEFT (Heterogeneous Earliest Finish Time) algorithm is used to minimize the cost and energy consumption rate. On the basis of total execution time at every processor, the jobs are prioritized. On the basis of job priorities, neural network is trained. The neural network is used to classify the jobs on the basis of energy consumption. The jobs are assigning to the processor that consume less energy. At last the computed parameters such as energy consumption, SLR (Schedule length ratio) and CCR (Computation Cost Ratio) are measured.


Task scheduling HEFT DAG Neural network 


  1. 1.
    Hu, F., Quan, X., Lu, C.: A schedule method for parallel applications on heterogeneous distributed systems with energy consumption constraint. In: Proceedings of the 3rd International Conference on Multimedia Systems and Signal Processing, pp. 134–141. ACM, April 2018Google Scholar
  2. 2.
    Zhou, N., Li, F., Xu, K., Qi, D.: Concurrent workflow budget-and deadline-constrained scheduling in heterogeneous distributed environments. Soft. Comput. 22, 1–14 (2018)CrossRefGoogle Scholar
  3. 3.
    Aba, M.A., Zaourar, L., Munier, A.: An approximation algorithm for scheduling applications on hybrid multi-core machines with communications delays. In: 2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 36–45. IEEE, May 2018Google Scholar
  4. 4.
    He, K., Meng, X., Pan, Z., Yuan, L., Zhou, P.: A novel task-duplication based DAG scheduling algorithm for heterogeneous environments. IEEE Trans. Parallel Distrib. Syst. 30, 2–14 (2018)CrossRefGoogle Scholar
  5. 5.
    Maurya, A.K., Tripathi, A.K.: On benchmarking task scheduling algorithms for heterogeneous computing systems. J. Supercomput. 1–32 (2018)Google Scholar
  6. 6.
    Sukhoroslov, O., Nazarenko, A., Aleksandrov, R.: An experimental study of scheduling algorithms for many-task applications. J. Supercomput. 1–15 (2018)Google Scholar
  7. 7.
    Chen, Y., Xie, G., Li, R.: Reducing energy consumption with cost budget using available budget preassignment in heterogeneous cloud computing systems. IEEE Access 6, 20572–20583 (2018)CrossRefGoogle Scholar
  8. 8.
    Padole, M., Shah, A.: Comparative study of scheduling algorithms in heterogeneous distributed computing systems. In: Advanced Computing and Communication Technologies, pp. 111–122. Springer, Singapore (2018)Google Scholar
  9. 9.
    Qin, L., Ouyang, F., Xiong, G.: Dependent task scheduling algorithm in distributed system. In: 2018 4th International Conference on Computer and Technology Applications (ICCTA). IEEE, May 2018Google Scholar
  10. 10.
    Marrakchi, S., Jemni, M.: A parallel scheduling algorithm to solve triangular band systems on multicore machine. Parallel Comput. Everywhere 32, 127 (2018)Google Scholar
  11. 11.
    AlEbrahim, S., Ahmad, I.: Task scheduling for heterogeneous computing systems. J. Supercomput. 73(6), 2313–2338 (2017)CrossRefGoogle Scholar
  12. 12.
    Zhou, N., Qi, D., Wang, X., Zheng, Z.: A static task scheduling algorithm for heterogeneous systems based on merging tasks and critical tasks. J. Comput. Methods Sci. Eng. (Preprint), pp. 1–18 (2017)Google Scholar
  13. 13.
    Arabnejad, H., Barbosa, J.G.: List scheduling algorithm for heterogeneous systems by an optimistic cost table. IEEE Trans. Parallel Distrib. Syst. 25(3), 682–694 (2014)CrossRefGoogle Scholar
  14. 14.
    Bittencourt, L.F., Sakellariou, R., Madeira, E.R.: Dag scheduling using a lookahead variant of the heterogeneous earliest finish time algorithm. In: 2010 18th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), pp. 27–34. IEEE, February 2010Google Scholar
  15. 15.
    Canon, L.C., Jeannot, E., Sakellariou, R., Zheng, W.: Comparative evaluation of the robustness of dag scheduling heuristics. In: Grid Computing, pp. 73–84. Springer, Boston (2008)Google Scholar
  16. 16.
    Daoud, M.I., Kharma, N.: A high performance algorithm for static task scheduling in heterogeneous distributed computing systems. J. Parallel Distrib. Comput. 68(4), 399–409 (2008)CrossRefGoogle Scholar
  17. 17.
    Zheng, W., Sakellariou, R.: Budget-deadline constrained workflow planning for admission control. J. Grid Comput. 11(4), 633–651 (2013)CrossRefGoogle Scholar
  18. 18.
    Munir, E.U., Mohsin, S., Hussain, A., Nisar, M.W., Ali, S.: SDBATS: a novel algorithm for task scheduling in heterogeneous computing systems. In: 2013 IEEE 27th International Parallel and Distributed Processing Symposium Workshops & Ph.D. Forum (IPDPSW), pp. 43–53. IEEE, May 2013Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Department of Computer Science and TechnologyUniversity Institute of Engineering and Technology (UIET), Punjab University (PU)ChandigarhIndia

Personalised recommendations