Skip to main content
SpringerLink
Log in

An Efficient Dynamic Priority-Queue Algorithm Based on AHP and PSO for Task Scheduling in Cloud Computing

  • Conference paper
  • First Online:
Proceedings of the 16th International Conference on Hybrid Intelligent Systems (HIS 2016) (HIS 2016)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 552))

Included in the following conference series:

Abstract

Nowadays Cloud Computing is an emerging technology in the area of parallel and distributed computing. Task scheduling is one of the major issues in cloud computing, which plays an important role to improve the overall performance and services of the cloud. Task scheduling in cloud computing means assign best suitable resources for the task to be executed with the consideration of different parameters like execution time, user priority, cost, scalability, throughput, makespan, resource utilization and so on. In this paper, we address the challenge of task scheduling, and we consider one of most critical issues in scheduling process such as the task priorities. The goal of this paper is to propose an efficient Dynamic Priority-Queue (DPQ) algorithm based on Analytic Hierarchy Process (AHP) with Particle Swarm Optimization (PSO) algorithm. The proposed algorithm DPQ-PSO gives full consideration to the dynamic characteristics of the cloud computing environment. Further, the proposed algorithm has been validated through the CloudSim simulator. The experimental results validate that the proposed approach can effectively achieve good performance, user priority, load balancing, and improve the resource utilization.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Mell, P., Grance, T.: The NIST Definition of Cloud Computing. National Institute of Standards and Technology, the NIST Special Publication 800-145. ACM (2011)

    Google Scholar 

  2. Hoang, H.N., Le Van, S., Maue, H.N., Bien, C.P.N.: Admission control and scheduling algorithms based on ACO and PSO heuristic for optimizing cost in cloud computing. In: Król, D., Madeyski, L., Nguyen, N.T. (eds.) Recent Developments in Intelligent Information and Database Systems. SCI, vol. 642, pp. 15–28. Springer, Heidelberg (2016). doi:10.1007/978-3-319-31277-4_2

    Chapter  Google Scholar 

  3. Thomas, A., Krishnalal, G., Jagathy Raj, V.: Credit based scheduling algorithm in cloud computing environment. Procedia Comput. Sci. 46, 913–920 (2015)

    Article  Google Scholar 

  4. Wu, X., Deng, M., Zhang, R., Zeng, B., Zhou, S.: A task scheduling algorithm based on QoS-driven in cloud computing. Procedia Comput. Sci. 17, 1162–1169 (2013)

    Article  Google Scholar 

  5. Karthick, A., Ramaraj, E., Subramanian, R.: An efficient multi queue job scheduling for cloud computing. In: 2014 World Congress on Computing and Communication (2014)

    Google Scholar 

  6. Verma, A., Kaushal, S.: Bi-criteria priority based particle swarm optimization workflow scheduling algorithm for cloud. In: RAECS (2014)

    Google Scholar 

  7. Patel, S., Bhoi, U.: Improved priority based job scheduling algorithm in cloud computing using iterative method. In: International Conference on Advances in Computing and Communications (2014)

    Google Scholar 

  8. Ghanbari, S., Othman, M.: A priority based job scheduling algorithm in cloud computing. Procedia Eng. 50, 778–785 (2012)

    Article  Google Scholar 

  9. Gu, L., Tang, Z., Xie, G.: The implementation of MapReduce scheduling algorithm based on priority. In: Li, K., Xiao, Z., Wang, Y., Du, J., Li, K. (eds.) ParCFD 2013. CCIS, vol. 405, pp. 100–111. Springer, Heidelberg (2014). doi:10.1007/978-3-642-53962-6_9

    Chapter  Google Scholar 

  10. Xu, L., Yang, J.-B.: Introduction to Multi-Criteria Decision Making and the Evidential Reasoning Approach. Working Paper No. 0106, May 2001

    Google Scholar 

  11. Saaty, T.L.: The Analytic Hierarchy Process. McGraw-Hill, New York (1980)

    MATH  Google Scholar 

  12. Saaty, T.L.: Decision making with the analytic hierarchy process. Int. J. Serv. Sci. 1(1), 83–98 (2008)

    Google Scholar 

  13. Alonso, J.A., Lamata, M.T.: Consistency in the analytic hierarchy process: a new approach. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 14, 445–459 (2006)

    Article  MATH  Google Scholar 

  14. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: International Conference on Neural Networks, vol. 4, pp. 1942–1948. IEEE (1995)

    Google Scholar 

  15. Clerc, M., Kennedy, J.: The particle swarm – explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 6, 58–73 (2002)

    Article  Google Scholar 

  16. Feng, Y., Teng, G., Wang, A., Yao, Y.: Chaotic inertia weight in particle swarm optimization. In: Second ICICIC, p. 475. IEEE (2007)

    Google Scholar 

  17. Xin, J., Chen, G., Hai, Y.: A particle swarm optimizer with multi-stage linearly-decreasing inertia weight. In: International Joint Conference on Computational Sciences and Optimization, pp. 505–508. IEEE (2009)

    Google Scholar 

  18. Yue-lin, G., Yu-hong, D.: A new particle swarm optimization algorithm with random inertia weight and evolution strategy. In: International Conference on Computational Intelligence and Security (CISW 2007), pp. 199–203. IEEE (2007)

    Google Scholar 

  19. Kennedy, J., Eberhart, R.: A discrete binary version of the particle swarm algorithm. In: International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, pp. 4104–4108. IEEE (1997)

    Google Scholar 

  20. Saaty, T.: How to make a decision: the analytic hierarchy process. Eur. J. Oper. Res. 48, 9–26 (1990)

    Article  MATH  Google Scholar 

  21. Maysum, P.: Iterative methods for computing eigenvalues and eigenvectors. Waterloo Math. Rev. 1, 9–18 (2011)

    Google Scholar 

  22. Calheiros, R., Ranjan, R., Beloglazov, A., De Rose, C., Buyya, R.: CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms. J. Softw.––Pract. Exp. 41, 23–50 (2011). ACM

    Article  Google Scholar 

  23. Parallel Workloads Archive: The Cornell Theory Center (CTC) IBM. http://www.cs.huji.ac.il/labs/parallel/workload/l_ctc_sp2/index.html

Download references

Author information

Authors and Affiliations

  1. LAVETE Laboratory, Science and Technical Faculty, Mathematics and Computer Science Department, Hassan 1 University, Settat, 26000, Morocco

    Hicham Ben Alla, Said Ben Alla & Abdellah Ezzati

  2. Department of Electronics and Informatics (ETRO), Vrije Universiteit Brussel, Pleinlaan 2, 1050, Brussels, Belgium

    Abdellah Touhafi

Authors
  1. Hicham Ben Alla
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Said Ben Alla
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abdellah Ezzati
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Abdellah Touhafi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hicham Ben Alla .

Editor information

Editors and Affiliations

  1. (MIR Labs), Machine Intelligence Research Labs, Auburn, Washington, USA

    Ajith Abraham

  2. Hassan 1st University, Settat, Morocco

    Abdelkrim Haqiq

  3. ENIS, University of Sfax, Sfax, Tunisia

    Adel M. Alimi

  4. Technopolis Rabat-Shore Rocade, International University of Rabat, Sala el Jadida, Morocco

    Ghita Mezzour

  5. Inst Applied Dept of Electronics, Taffala, University of Sousse, Sousse, Tunisia

    Nizar Rokbani

  6. Fakulti Teknologi Maklumat dan Komunikas, Universiti Teknikal Malaysia Melaka, Durian Tunggal, Malaysia

    Azah Kamilah Muda

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Ben Alla, H., Ben Alla, S., Ezzati, A., Touhafi, A. (2017). An Efficient Dynamic Priority-Queue Algorithm Based on AHP and PSO for Task Scheduling in Cloud Computing. In: Abraham, A., Haqiq, A., Alimi, A., Mezzour, G., Rokbani, N., Muda, A. (eds) Proceedings of the 16th International Conference on Hybrid Intelligent Systems (HIS 2016). HIS 2016. Advances in Intelligent Systems and Computing, vol 552. Springer, Cham. https://doi.org/10.1007/978-3-319-52941-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-52941-7_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-52940-0

  • Online ISBN: 978-3-319-52941-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation