Open Access   Article Go Back

Optimized Scheduling Procedure for Enhancing Resource Utilization in Hetrogeneous Cloud Enviornment

Hardeep Kaur1 , Anil Kumar2

Section:Research Paper, Product Type: Journal Paper
Volume-7 , Issue-2 , Page no. 207-215, Feb-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7i2.207215

Online published on Feb 28, 2019

Copyright © Hardeep Kaur, Anil Kumar . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Hardeep Kaur, Anil Kumar, “Optimized Scheduling Procedure for Enhancing Resource Utilization in Hetrogeneous Cloud Enviornment,” International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.207-215, 2019.

MLA Style Citation: Hardeep Kaur, Anil Kumar "Optimized Scheduling Procedure for Enhancing Resource Utilization in Hetrogeneous Cloud Enviornment." International Journal of Computer Sciences and Engineering 7.2 (2019): 207-215.

APA Style Citation: Hardeep Kaur, Anil Kumar, (2019). Optimized Scheduling Procedure for Enhancing Resource Utilization in Hetrogeneous Cloud Enviornment. International Journal of Computer Sciences and Engineering, 7(2), 207-215.

BibTex Style Citation:
@article{Kaur_2019,
author = {Hardeep Kaur, Anil Kumar},
title = {Optimized Scheduling Procedure for Enhancing Resource Utilization in Hetrogeneous Cloud Enviornment},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {2 2019},
volume = {7},
Issue = {2},
month = {2},
year = {2019},
issn = {2347-2693},
pages = {207-215},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=3644},
doi = {https://doi.org/10.26438/ijcse/v7i2.207215}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i2.207215}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=3644
TI - Optimized Scheduling Procedure for Enhancing Resource Utilization in Hetrogeneous Cloud Enviornment
T2 - International Journal of Computer Sciences and Engineering
AU - Hardeep Kaur, Anil Kumar
PY - 2019
DA - 2019/02/28
PB - IJCSE, Indore, INDIA
SP - 207-215
IS - 2
VL - 7
SN - 2347-2693
ER -

VIEWS PDF XML
407 313 downloads 186 downloads
  
  
           

Abstract

Because of a phenomenal increment in the quantity of computing assets in various associations, compelling jobs scheduling algorithms are required for proficient asset use. Job scheduling in considered as NP difficult issue in parallel and disseminated registering situations, for example, group, matrix and mists. Meta-heuristics, for example, Genetic Algorithms, Ant Colony Optimization, Artificial Bee Colony, Cuckoo Search, Firefly Algorithm, Bat Algorithm and so on are utilized by researchers to get close ideal answers for work scheduling issues. These meta-heuristic algorithms are utilized to plan distinctive sorts of jobs, for example, BSP, Workflow and DAG, Independent undertakings and Bag-of-Tasks. This paper is an endeavor to give exhaustive review of prominent nature-enlivened meta-heuristic procedures which are utilized to plan distinctive classifications of jobs to accomplish certain execution targets.

Key-Words / Index Term

ACO, BAT, Cuckoo, genetic algorithm

References

[1] F. Sabahi, “Cloud Computing Security Threats and Responses,” pp. 245–249, 2011.
[2] D. Boru, D. Kliazovich, F. Granelli, P. Bouvry, and A. Y. Zomaya, “Energy-efficient data replication in cloud computing datacenters,” Cluster Comput., vol. 18, no. 1, pp. 385–402, 2015.
[3] N. M. Dhanya and G. Kousalya, “Adaptive and Secure Application Partitioning for Of fl oading in Mobile Cloud Computing,” vol. 1, pp. 45–53, 2015.
[4] and M. R. L. Zhang, Z. Zheng, “BFTCloud: A byzantine fault tolerance framework for voluntary-resource cloud computing,” Cloud Comput. (CLOUD), 2011 IEEE Int. Conf., pp. 444–451, 2011.
[5] S. Pandey, L. Wu, S. M. Guru, and R. Buyya, “A Particle Swarm Optimization-based Heuristic for Scheduling Workflow Applications in Cloud Computing Environments,” 2010.
[6] A. Kaur, “A Review on Various Job Scheduling Algorithms,” vol. 13, no. 3, pp. 359–367, 2017.
[7] S. Id, W. Count, and C. E. R. Count, “A GA Based Job Scheduling strategy for Computational Grid by Krishan Veer,” pp. 29–34, 2015.
[8] R. Baldoni, J. M. Hélary, A. Mostefaoui, and M. Raynal, “On modeling consistent checkpoints and the domino effect in distributed systems,” Rapp. Rech. Natl. Rech. En Inform. En Autom., 1995.
[9] X. Zhou and L. Y. He, “A virtualized hybrid distributed file system,” Proc. - 2013 Int. Conf. Cyber-Enabled Distrib. Comput. Knowl. Discov. CyberC 2013, pp. 202–205, 2013.
[10] M. Arioua, Y. Assari, I. Ez-zazi, and A. Oualkadi, “Multi-hop cluster based routing approach for wireless sensor networks,” Procedia - Procedia Comput. Sci., vol. 83, no. Ant, pp. 584–591, 2016.
[11] S. P. Dandamudi, “Parallel Job Scheduling on Multicluster Computing Systems,” 2003.
[12] P. Switalski and F. Seredynski, “Scheduling parallel batch jobs in grids with evolutionary metaheuristics,” J. Sched., vol. 18, no. 4, pp. 345–357, 2014.
[13] “Content Checked For Plagiarism : al lS eo oo lS.”
[14] S. Tahilyani, “A New Genetic Algorithm Based Lane-By-Pass Approach for Smooth Traffic Flow on Road Networks,” vol. 1, no. 3, pp. 32–36, 2012.
[15] C. R. Reeves, “A genetic algorithm for flowshop sequencing,” Comput. Oper. Res., vol. 22, no. 1, pp. 5–13, Jan. 1995.
[16] W. Wen, C. Wang, D. Wu, and Y. Xie, “An ACO-Based Scheduling Strategy on Load Balancing in Cloud Computing Environment,” 2015.
[17] B. Li, W. Xu, S. Member, and H. Zhang, “PAPR Reduction for Hybrid ACO-OFDM Aided IM / DD Optical Wireless Vehicular Communications,” vol. 9545, no. c, 2017.
[18] A. Hossein and G. X. Yang, “Bat algorithm for constrained optimization tasks,” pp. 1239–1255, 2013.
[19] S. Mirjalili and S. Mohammad, “Binary bat algorithm,” 2013.
[20] J. Xie, Y. Zhou, and H. Chen, “A novel bat algorithm based on differential operator and Levy flights trajectory,” Comput. Intell. Neurosci., vol. 2013, 2013.
[21] I. Engineering, “OPTIMAL POWER FLOW USING CUCKOO OPTIMIZATION ALGORITHM,” pp. 4213–4218, 2013.
[22] N. Optimisation, “A comprehensive review of cuckoo search : variants and hybrids Iztok Fister Jr .*, Dušan Fister and Iztok Fister,” vol. 4, no. 4, 2013.
[23] K. C. Udaiyakumar and M. Chandrasekaran, “Application of Firefly Algorithm in Job Shop Scheduling Problem for Minimization of Makespan,” Procedia Eng., vol. 97, pp. 1798–1807, 2014.
[24] B. Jiang, J. Wu, X. Zhu, and D. Hu, “Priority-Based Live Migration of Virtual Machine,” pp. 376–385, 2013.
[25] M. R. Abid, K. Kaddouri, K. Smith, M. Idriss, E. Ouadghiri, and M. Gerndt, “Virtual Machines ’ Load-Balancing in Inter-Clouds,” pp. 5–12, 2016.
[26] X. Y. S. Deb, “Cuckoo search : recent advances and applications,” 2013.
[27] X. Cui, B. Mills, T. Znati, and R. Melhem, “Shadow replication: An energy-aware, fault-tolerant computational model for green cloud computing,” Energies, vol. 7, no. 8, pp. 5151–5176, 2014.
[28] A. Thomas, G. Krishnalal, and J. R. V P, “Credit Based Scheduling Algorithm in Cloud Computing Environment,” Procedia - Procedia Comput. Sci., vol. 46, no. Icict 2014, pp. 913–920, 2015.
[29] N. Kord and H. Haghighi, “An Energy-Efficient Approach for Virtual Machine Placement in Cloud Based Data Centers,” pp. 44–49, 2013.
[30] J. Li, C. Pu, Y. Chen, V. Talwar, and D. Milojicic, “Improving Preemptive Scheduling with Application-Transparent Checkpointing in Shared Clusters,” pp. 222–234.