An adaptive load balancing algorithm for heterogeneous distributed systems with multiple task classes

Distributed systems are increasingly becoming the dominant and rapidly expanding computational paradigm of tomorrow. A cluster is really a form of parallel or distributed processing system that consists of a set of intertwined stand-alone machines that function together like truly coherent computing and storage resources with a single system image (SSI) which means that perhaps the clusters are viewed as a single platform by the consumers. Global resource management, on the other hand, poses several concerns due to the sheer complexity and range of tools, as well as the need for user accountability. The possible advantages of load balancing in addressing the occasional congestion faced by some nodes when everyone else is idle or congested are widely agreed on a level of performance. This is also widely acknowledged that neither specific load balancing algorithm can adequately address evolving device characteristics and complex capacity management in a distributed ecosystem. To have a systematic approach and also in distributed systems, a proposed approach is created for a holistic view of element load balancing and also the qualities features of load balancing algorithms. The nomenclature has been expanded. In order for adaptive algorithms to understand the problem and manner of prefixing resilience along with different components in distributed systems, they must first recognize the concerns. In addition, a proposed approach is specified. The much more effective load balancing techniques and the modeling hypotheses used in prior load balancing experiments are established through a study of related research. We consider the most appropriate load balancing algorithm and optimum metrics for parameter estimation of the algorithm as a consequence of and output of this assessment for a range of formulations of resulting goals, distributed system features, and workload balancing framework.

Download Full-text

Node Availability for Distributed Systems considering processor and RAM utilization for Load Balancing

International Journal of Computers Communications & Control ◽

10.15837/ijccc.2010.3.2486 ◽

2010 ◽

Vol 5 (3) ◽

pp. 336

Author(s):

Antonio Menendez Leonel de Cervantes ◽

Hector Benitez Perez

Keyword(s):

Distributed Systems ◽

Load Balancing ◽

Distributed System ◽

Dynamic Scheduling ◽

Decision Criterion ◽

Dynamic Load Balancing ◽

Other Information ◽

Node Availability ◽

Load Balancing Algorithm

<p>Node-Availability is a new metric that based on processor utilization, free RAM and number of processes queued at a node, compares different workload levels of the nodes participating in a distributed system. Dynamic scheduling and Load-Balancing in distributed systems can be achieved through the Node-Availability metric as decision criterion, even without previously knowing the execution time of the processes, nor other information about them such as process communication requirements.<br /> This paper also presents a case study which shows that the metric is feasible to implement in conjunction with a dynamic Load-Balancing algorithm, obtaining an acceptable performance.</p>

Download Full-text

An Efficient Server Minimization Algorithm for Internet Distributed Systems

International Journal of Rough Sets and Data Analysis ◽

10.4018/ijrsda.2017100102 ◽

2017 ◽

Vol 4 (4) ◽

pp. 17-30

Author(s):

Swati Mishra ◽

Sanjaya Kumar Panda

Keyword(s):

Distributed Systems ◽

Standard Deviation ◽

Load Balancing ◽

Load Factor ◽

Sleep Mode ◽

Minimization Algorithm ◽

Online Services ◽

Unequal Distribution ◽

Simulation Results ◽

Load Balancing Algorithm

The increasing use of online services leads to an unequal distribution of the loads among the servers. As a result, the problem is to balance the loads among the servers such that the total number of active servers is minimized. One of the possible solutions is to transfer the loads from the underutilized server to a suitable server and make the underutilized server to sleep mode. In this paper, a server minimization algorithm (SMA) is proposed for the solution of server minimization and the load balancing problem. The proposed algorithm reduces the number of servers by merging the loads of the two least loaded servers. Then it determines the standard deviation of the server loads for load balancing. The proposed SMA is compared with an existing load balancing algorithm using the number of minimized servers, load standard deviation and load factor. The simulation results show the efficacy of the SMA.

Download Full-text