SEATS: smart energy-aware task scheduling in real-time cloud computing

2014 ◽  
Vol 71 (1) ◽  
pp. 45-66 ◽  
Author(s):  
Seyedmehdi Hosseinimotlagh ◽  
Farshad Khunjush ◽  
Rashidaldin Samadzadeh
2020 ◽  
Vol 13 (4) ◽  
pp. 745-758 ◽  
Author(s):  
Junlong Zhou ◽  
Jin Sun ◽  
Peijin Cong ◽  
Zhe Liu ◽  
Xiumin Zhou ◽  
...  

2011 ◽  
Vol E94-D (4) ◽  
pp. 822-832
Author(s):  
Dejun QIAN ◽  
Zhe ZHANG ◽  
Chen HU ◽  
Xincun JI

Author(s):  
Dinkan Patel ◽  
Anjuman Ranavadiya

Cloud Computing is a type of Internet model that enables convenient, on-demand resources that can be used rapidly and with minimum effort. Cloud Computing can be IaaS, PaaS or SaaS. Scheduling of these tasks is important so that resources can be utilized efficiently with minimum time which in turn gives better performance. Real time tasks require dynamic scheduling as tasks cannot be known in advance as in static scheduling approach. There are different task scheduling algorithms that can be utilized to increase the performance in real time and performing these on virtual machines can prove to be useful. Here a review of various task scheduling algorithms is done which can be used to perform the task and allocate resources so that performance can be increased.


2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Weizhe Zhang ◽  
Hucheng Xie ◽  
Boran Cao ◽  
Albert M. K. Cheng

Energy consumption in computer systems has become a more and more important issue. High energy consumption has already damaged the environment to some extent, especially in heterogeneous multiprocessors. In this paper, we first formulate and describe the energy-aware real-time task scheduling problem in heterogeneous multiprocessors. Then we propose a particle swarm optimization (PSO) based algorithm, which can successfully reduce the energy cost and the time for searching feasible solutions. Experimental results show that the PSO-based energy-aware metaheuristic uses 40%–50% less energy than the GA-based and SFLA-based algorithms and spends 10% less time than the SFLA-based algorithm in finding the solutions. Besides, it can also find 19% more feasible solutions than the SFLA-based algorithm.


2018 ◽  
Vol 36 (3) ◽  
pp. 529-553 ◽  
Author(s):  
Chaogang Tang ◽  
Mingyang Hao ◽  
Xianglin Wei ◽  
Wei Chen

Sign in / Sign up

Export Citation Format

Share Document