An Effective Load Balancing Algorithm Based on Deadline Constraint under Cloud Computing

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Arif, K. I. (2020). An Effective Load Balancing Algorithm Based on Deadline Constraint under Cloud Computing. In IOP Conference Series: Materials Science and Engineering (Vol. 928). IOP Publishing Ltd. https://doi.org/10.1088/1757-899X/928/3/032070

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free