E-HEFT: Enhancement Heterogeneous Earliest Finish Time algorithm for Task Scheduling based on Load Balancing in Cloud Computing
Texte intégral
Figure
Documents relatifs
L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des
Energy Aware Clouds Scheduling Using Anti-load Balancing Algorithm - EACAB.. Cheikhou Thiam, Georges Da-Costa and
Development of a formal model followed by the e- STAB scheduler for the selection of a proper server, a rack and a module for each incoming to the data center workload in real
The research work [7] suggests a program partitioning based on the estima- tion of the energy consumption (communication energy and computation energy) before the program execution.
Therefore, our proposed estimation-based task load balancing scheduling technique achieves the task load balancing according to the performance of instances.. 1
More importantly, we have shown that there does not exist any algorithm that is simultaneously an approximation algorithm for both makespan minimization and peak memory
The previous heuristic ParInnerFirst is motivated by good memory results for sequential postorder. Going the opposite direction, a heuristic objective can be the minimization of
The SliceRing optimization problem can be solved by computing the solution of p integer linear programs, where p is the total number of resources.. 6 Heuristics
