Server Load balancing meaning Essay

Load Balancing is mainly used to distribute the workload evenly among all servers, to avoid overloaded condition, where load is transferred from an overloaded server to under loaded servers. Load balancing is used to ensure fairness in the system, whereby resource utilization is maximized. Load balancing is used for eschewing heavy over load on the resources and bisects the traffic amidst servers and data. Data can be sent and received without much delay. This balancing of load enables to reduce total waiting time of the resources. An energy aware load balancer aid in minimizing the power consumption and thereby saves energy conservation. This sustains the availability of computing resources.
The main goal of load balancing algorithm is to achieve optimal resource utilization, maximize throughput, minimize response time and avoid overload, crashing and delay. Self-adaptive algorithms like First-cum-First-Served (FCFS) and Weighted First-cum-First-Served (WFCFS), which are suitable for dynamic environments, are examples of energy aware load balancers that minimize power consumption, minimize execution time and processing cost.
Load balancing is aimed at improving the performance of the system by distributing of workload among the processors. Workload of a machine means the total length of the schedule required to execute all the tasks assigned to the machine and complete the job. Load balancing is done so that every virtual machine in the data center does the same amount of work throughout therefore increasing the throughput and minimizing the response time. The working performance of the cloud service provider is mainly improved by load balancing. The balancing of load among virtual machines uniformly means that available machine is not idle or partially loaded while others are heavily loaded. One of the critical issue of cloud computing is to divide the workload dynamically and this is achieved by energy aware load balancers. In the Weighted First-cum-First-Served (WFCFS) method weight is assigned to each task based on the number of tasks on which it depends. First the tasks are inserted into the queue in the non decreasing order of the arrival time. Then the tasks in the queue are sorted according to the increasing order of their weight. Minimizing power consumption while guaranteeing the timing and other constraints has become a critical aspect in designing distributed real-time systems. Weighted FCFS load balancer algorithm is used to find the suitable VM in a short time period based on weights assigned. The load balancing is achieved by Weighted First-cum-First-Served (WFCFS) algorithm for dynamic and distributed environment in comparison with the normal FCFS and Round Robin techniques.
It is observed that Weighted First-cum-First-Served (WFCFS) algorithm gives the best result in terms of minimal power consumption, minimal cost and minimal time taken and thereby is chosen as optimal load balancer algorithm in comparison with the existing Round Robin, First-cum-First-Served and Throttled Load balancer and there is noticeable improvement in the overall performance, when using WFCFS technique as an energy aware load balancer for optimal resource provisioning in cloud data centers.The WFCFSVmLoadBalancer is used in allocation of virtual machines according to weight.