Deadline constrained task scheduling in the cloud computing using a discrete firefly algorithmComment

##plugins.themes.academic_pro.article.sidebar##

Published Nov 1, 2017
https://doi.org/10.47164/ijngc.v8i3.131
Download
PDF
Statistic

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...
Volume 8, Issue 3, November 2017

##plugins.themes.academic_pro.article.main##

Mina Hoseinnejhad
Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz
Nima Jafari Navimipour
Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz

Abstract

Cloud computing is used to provide convenient and quick access to a shared pool of configurable computing resources. In cloud computing, information technology (IT) related capabilities are provided as services, accessible cloud computing is a model to provide convenient and on-demand access without requiring detailed knowledge of the underlying technologies, and with minimal management effort. There are many challenges in cloud computing. Tasks scheduling is considered as one of these challenges. The concept of scheduling as one of the famous NPHard problems is an optimal allocation of suitable resources to tasks. This study presents a new deadline–aware scheduling approach using discrete firefly algorithm. The makespan is improved compared to FCFS, A2DJS, ELPR, and HLBA scheduling algorithm based on the results of simulation in the Cloudsim environment. Also, missed tasks are decreased using the suggested method compared to FCFS, SPN, HRRN, and PSO.

##plugins.themes.academic_pro.article.details##

How to Cite
Hoseinnejhad, M. ., & Navimipour, N. J. . (2017). Deadline constrained task scheduling in the cloud computing using a discrete firefly algorithmComment. International Journal of Next-Generation Computing, 8(3), 198–209. https://doi.org/10.47164/ijngc.v8i3.131
Crossref
Scopus
Google Scholar
Europe PMC

References

  1. Aceto, G., Botta, A., de Donato, W., and Pescap. 2013. Cloud monitoring. a survey. Computer Networks, 2115-2093.
  2. Ashouraie, M. and Jafari Navimipour, N. 2015. Priority-based task scheduling on heterogeneous resources in the expert cloud. Kybernetes 44, 1455-1471.
  3. Bansal, N., Maurya, A., Kumar, T., Singh, M., and Bansal, S. 2015. Cost performance of qos driven task scheduling in cloud computing. Procedia Computer Science 57, 126-130.
  4. Bean, J. C. 1994. Genetic algorithm and random keys for sequencing and optimization. ORSA J. Comput. 6, 154-160.
  5. Chiregi, M. and Navimipour, N. J. 2016. Trusted services identi cation in the cloud environment using the topological metrics. Karbala International Journal of Modern Science 2, 3, 203-210.
  6. Chong, H.-y., Wong, J. S., and Wang, X. 2014. An explanatory case study on cloud computing applications in the built environment. Automation in Construction 44, 152162.
  7. Fouladi, P. and Navimipour, J. N. 2017. uman resources ranking in a cloud-based knowledge sharing framework using the quality control criteria. Kybernetes 46, 5.
  8. Gurkok, C. 2014. Securing cloud computing systems. Network and System Security(Second Edition), 83-126.
  9. Hajizadeh, R. and Navimipour, J. N. 2017. A method for trust evaluation in the cloud environments using a behavior graph and services grouping. Kybernetes.
  10. Hazratzadeh, S. and Jafari Navimipour, N. 2017. Colleague recommender system in the Expert Cloud using the features matrix. Kybernetes.
  11. Jena, R. 2015. Multi objective task scheduling in cloud environment using nested pso framework. Procedia Computer Science 57, 1219-1227.
  12. Keshk, A. E., El-Sisi, A. B., and Tawfeek, M. A. 2014. International Journal of Intelligent Systems and Applications 6, 25.
  13. Komarasamy, D. and Muthuswamy, V. 2015. Adaptive deadline based dependent job scheduling algorithm in cloud computing. Seventh International Conference on the Advanced Computing (ICoAC).
  14. Kumar, V. V. and Palaniswami, S. 2012. A dynamic resource allocation method for parallel dataprocessing in cloud computing. Journal of computer science 8, 780.
  15. Laili, Y., Tao, F., Zhang, L., Cheng, Y., Luo, Y., and Sarker, B. R. 2013. A ranking chaos algorithm for dual scheduling of cloud service and computing resource in private cloud. Computers in Industry 64, 448-463.
  16. Liu, Z., Qu, W., Liu, W., Li, Z., and Xu, Y. 2015. Resource preprocessing and optimal task scheduling in cloud computing environments. Concurrency and Computation: Practice and Experience 27, 3461-3482.
  17. Lukasik, S. and Zak, S. 2009. Fire y algorithm for continuous constrained optimization tasks. In Paper presented at the International Conference on Computational Collective Intelligence.
  18. Marichelvam, M. K., Prabaharan, T., and Yang, X. S. 2014. A discrete re y algorithm for the multi-objective hybrid flowshop scheduling problems. IEEE transactions on evolutionary computation 18, 301-305.
  19. Mohammadi, S. Z. and Navimipour, J. N. 2017. Invalid cloud providers' identi cation using the support vector machine. International Journal of Next-Generation Computing.
  20. Navimipour, J. N., Masoud Rahmani, A., Habibizad Navin, A., and Hosseinzadeh, M. 2014. Job scheduling in the expert cloud based on genetic algorithms. Kybernetes 43, 1262-1275.
  21. Navimipour, N. J. 2015. Task scheduling in the cloud environments based on an arti cial bee colony algorithm. In Paper presented at the International Conference on Image Processing, Production and Computer Science. Istanbul(Turkey).
  22. Navimipour, N. J. and Milani, F. S. 2015. A comprehensive study of the resource discovery techniques in peer-to-peer networks. Peer-to-Peer Networking and Applications 8, 474-492.
  23. Oliveira, T., Thomas, M., and Espadanal, M. 2014. Assessing the determinants of cloud computing adoption: An analysis of the manufacturing and services sectors. Information Management 51, 497-510.
  24. Sayadi, M., Ramezanian, R., and Ghaffari-Nasab, N. 2010. A discrete re y meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems. International Journal of Industrial Engineering Computations 1, 1-10.
  25. Sheikholeslami, F. and Navimipour, J. N. 2017. Service allocation in the cloud environments using multi-objective particle swarm optimization algorithm based on crowding distance. Swarm and Evolutionary Computation.
  26. Singh, S. and Chana, I. 2016. A survey on resource scheduling in cloud computing: Issues and challenges. Journal of Grid Computing 14, 217-264.
  27. S.Manvi, S. and Shyam, G. 2014. Resource management for infrastructure as a service (iaas) in cloud computing: a survey. Journal of Network and computer and applications 41, 424-440.
  28. Tasgetiren, M. F., Liang, Y.-c., Sevkli, M., and Gencyilmaz, G. 2007. A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European journal of operational research 177, 1930-1947.
  29. Tsai, C.-W., Huang, W.-C., Chiang, M.-H., Chiang, M.-C., and Yang, C.-S. 2014. A hyper-heuristic scheduling algorithmfor cloud. IEEE Trans.Cloud Comput.
  30. Wu, Z., Liu, X., Ni, Z., Yuan, D., and Yang, Y. 2013. A market-oriented hierarchical scheduling strategy in cloud work flow systems. The Journal of Supercomputing, 1-38.
  31. Yang, X.-s. 2008. Nature-Inspired Metaheuristic Algorithm. Luniver, Bristol, U.K.
  32. Yang, X.-s. 2009. Firefly algorithms for multimodal optimization. In Paper presented at the International symposium on stochastic algorithms.
  33. Yang, X.-s. 2010. Firefly algorithm, stochastic test functions and design optimisation. International Journal of Bio-Inspired Computation 2, 78-84.
  34. Zeng, L., Veeravalli, B., and Zomaya, A. Y. 2015. An integrated task computation and data management scheduling strategy for work flow applications in cloud environments. Journal of Network and Computer Applications 50, 39-48.