A REVIEW ON ENERGY EFFICIENT JOB SCHEDULING ALGORITHMS IN GREEN CLOUD COMPUTING
DOI:
https://doi.org/10.22159/ajpcr.2017.v10s1.20509Keywords:
Cloud computing, Job scheduling, Resource allocation, Efficiency, Performance, CostAbstract
Cloud computing is the hottest topic in today's world and is being used by most of the information technology companies due to its benefits in
cost saving and ease of use. It is a dynamic, scalable, and pay-per-use distributed computing model. The cloud computing is aims to give access
to remote and geographically distributed resources. Scheduling the job from one data center to other data center or from one region of cloud to
other region is truly a testing in cloud environment. However, when data are shifted from one data center to other data center, huge amount of
carbon dioxide (CO2) gases emits and also consumes more power. Since energy is an important issue, that is, why green cloud computing comes
into the picture. Green cloud computing can be obtained by applying various techniques and algorithms, which use less power and emits less
CO2 gas, that is, damaging the environment. Cloud provides many facilities to its tenants such as sharing of resources for different purposes. In
cloud domain, job scheduling is one of the biggest and hypothetical problems. Numerous investigations for scheduling a job and efforts carried
out in this regard because it is one of the main jobs to get the most profit. Scheduling can decrease the power consumption. So many algorithms
had been proposed for this purpose, and a lot more had to be done. In the paper, intends to present a variety of energy-efficient job scheduling
algorithms along with performance comparison analysis of various preexisting algorithms for scheduling jobs to provide energy efficiency in
green cloud computing.
Downloads
References
Gaganjot Kaur , sugandhi Midha , A pre-emptive Priority based job scheduling algorithm in green cloud computing ,2016 6th International Conference-clous system and Big Data engineering(confluence)
Dzmitry Kliazovich, Sisay T. Arzo, Fabrizio Granelli, Pascal Bouvry and Samee Ullah Khan , eSTAB: Energy-Efficient Scheduling for Cloud Computing Applications with Traffic Load Balancing, 2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing
Kapil Kumar, Abhinav Hans, Ashish Sharma, Navdeep Singh, Towards the various cloud computing scheduling concerns: A Review
Pankajdeep kaur and Parampreet singh, priority based scheduling algorithm with fast task completion rate in cloud IIJSTR VOL 2 Issue 11, NOVEMBER 2013
Abeer h el bakely, Hesham a.hefny , Using shortest job first scheduling in green cloud computing, International Journal of Advanced Research 9, September 2015
Ziqian Dong, Ning Liu and Roberto Rojas-Cessa Dong et al , greedy scheduling of tasks with time constraint for energyefficient cloud computing data centers, journal of cloud computing (2015)
Truong vinh truong et al , performance evaluation of a green scheduling algorithm for energy savings in cloud computing,
Fei cao, Michelle m. zhu , energy efficient workflow job scheduling for green cloud, 2013 IEEE
Shimpy, Jagandeep sidhu Different scheduling algorithms in different cloud environment Engineering ijarcce 9, Sept 2014
B. Gayathri , green cloud computing (seiscon 2012), 27-29 2012.
Bharti wadhwa ,Amandeep verma , energy saving approaches for green cloud computing: A Review, ©2014 IEEE
Sonika P Reddy ,Chandan H K S, Energy Aware scheduling of real time and non real time tasks on cloud processor green cloud computing, ©2014 IEEE
Zhuo Tang, Zhenzhen Cheng, Kenli Liztang@hnu.edu.cn Keqin LiAn ,efficient energy scheduling algorithm for workflow tasks in hybrids and dvfs enabled cloud environment, © 2014 IEEE
Er.Shimpy, Mr Jaydeep sindhu Different scheduling algorithms in different cloud computing, IJARCCE vol.3 issue 9 September
Published
How to Cite
Issue
Section
The publication is licensed under CC By and is open access. Copyright is with author and allowed to retain publishing rights without restrictions.
