Abstract
Abstract
Cloud computing is one of the attractive topics in distributed systems. It provides services on-demand based on pay-as-you-go basis. Task scheduling and load balancing are important research issues in cloud computing. Task scheduling means distributing tasks to resources (Virtual Machines) while load balancing refers to distribution tasks among resources to even workload. In this paper, we propose an Effective Load Balancing Algorithm with Deadline constraint (ELBAD). The ELBAD allocates nearest deadline tasks each time to the highest speed Virtual Machines (VMs) then it balances workload among VMs. The proposed algorithm is compared with other existing algorithms such as FCFS, SJF, Min-Min and EDF and experimental results show superiority of ELBAD over others with respect to minimizing makespan and maximizing resource utilization.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献