LBSR: Load Balance Over Slow Resources

摘要

Cloud provides convenient and on demand network access for computing resources available over internet. There are many tasks required to be executed by the available resources to achieve the best performance, reduce response time and utilize resources. Load balancing algorithms that based only on load balancing, improve resource utilization. However these algorithms don't take resource speed and task length in their consideration. On the other hand, load balancing algorithms that based on completion time of tasks and speed of resources to reduce makespan don't take the resource load into their consideration. In this paper, Load Balance over Slow Resources (LBSR) algorithm is proposed. It assigns tasks to resources in a way that results in high load balancing over all resources including very slow ones. The performance of LBSR algorithm is evaluated against three well known load balancing algorithms: Min-Min, LBIMM, and Optimized TSA algorithms. The simulation results show that LBSR outperforms the other algorithms significantly in terms of makespan, resource utilization, and load deviation. The enhancement reaches more than 50% in some situations.