scholarly journals Energy Efficient Heuristic Base Job Scheduling Algorithms in Cloud Computing

2017 ◽  
Vol 19 (01) ◽  
pp. 50-55
Author(s):  
Jaspreet Singh ◽  
Deepali Gupta
2020 ◽  
Vol 2020 ◽  
pp. 1-17 ◽  
Author(s):  
Ibrahim Attiya ◽  
Mohamed Abd Elaziz ◽  
Shengwu Xiong

In recent years, cloud computing technology has attracted extensive attention from both academia and industry. The popularity of cloud computing was originated from its ability to deliver global IT services such as core infrastructure, platforms, and applications to cloud customers over the web. Furthermore, it promises on-demand services with new forms of the pricing package. However, cloud job scheduling is still NP-complete and became more complicated due to some factors such as resource dynamicity and on-demand consumer application requirements. To fill this gap, this paper presents a modified Harris hawks optimization (HHO) algorithm based on the simulated annealing (SA) for scheduling jobs in the cloud environment. In the proposed HHOSA approach, SA is employed as a local search algorithm to improve the rate of convergence and quality of solution generated by the standard HHO algorithm. The performance of the HHOSA method is compared with that of state-of-the-art job scheduling algorithms, by having them all implemented on the CloudSim toolkit. Both standard and synthetic workloads are employed to analyze the performance of the proposed HHOSA algorithm. The obtained results demonstrate that HHOSA can achieve significant reductions in makespan of the job scheduling problem as compared to the standard HHO and other existing scheduling algorithms. Moreover, it converges faster when the search space becomes larger which makes it appropriate for large-scale scheduling problems.


Author(s):  
Ahmed Subhi Abdalkafor ◽  
Khattab M. Ali Alheeti

Cloud computing plays an important role in our daily life. It has direct and positive impact on share and update data, knowledge, storage and scientific resources between various regions. Cloud computing performance heavily based on job scheduling algorithms that are utilized for queue waiting in modern scientific applications. The researchers are considered cloud computing a popular platform for new enforcements. These scheduling algorithms help in design efficient queue lists in cloud as well as they play vital role in reducing waiting for processing time in cloud computing. A novel job scheduling is proposed in this paper to enhance performance of cloud computing and reduce delay time in queue waiting for jobs. The proposed algorithm tries to avoid some significant challenges that throttle from developing applications of cloud computing. However, a smart scheduling technique is proposed in our paper to improve performance processing in cloud applications. Our experimental result of the proposed job scheduling algorithm shows that the proposed schemes possess outstanding enhancing rates with a reduction in waiting time for jobs in queue list.


2012 ◽  
Vol 2012 ◽  
pp. 1-16 ◽  
Author(s):  
Xiaoli Wang ◽  
Yuping Wang ◽  
Hai Zhu

For the problem that the energy efficiency of the cloud computing data center is low, from the point of view of the energy efficiency of the servers, we propose a new energy-efficient multi-job scheduling model based on Google’s massive data processing framework. To solve this model, we design a practical encoding and decoding method for the individuals and construct an overall energy efficiency function of the servers as the fitness value of each individual. Meanwhile, in order to accelerate the convergent speed of our algorithm and enhance its searching ability, a local search operator is introduced. Finally, the experiments show that the proposed algorithm is effective and efficient.


Author(s):  
Meenakshi Garg ◽  
Gaurav Dhiman

In recent years, cloud computing technology has gained a great deal of interest from both academia and industry. Cloud computing's success benefited from its ability to offer global IT services such as core infrastructure, platforms, and applications to cloud customers around the web. It also promises on-demand offerings and new ways of pricing packages. However, cloud job scheduling is still NP-complete and has become more difficult due to certain factors such as resource dynamics and on-demand customer application requirements. To fill this void, this chapter presents the seagull optimization algorithm (SOA) for scheduling work in the cloud world. The efficiency of the SOA approach is compared to that of state-of-the-art job scheduling algorithms by having them all implemented in the CloudSim toolkit.


Sign in / Sign up

Export Citation Format

Share Document