A Fault Tolerance Optimal Neighbor Load Balancing Algorithm for Grid Environment

Author(s):  
J Balasangameshwara ◽  
N Raju
2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
P. Keerthika ◽  
P. Suresh

Grid environment consists of millions of dynamic and heterogeneous resources. A grid environment which deals with computing resources is computational grid and is meant for applications that involve larger computations. A scheduling algorithm is said to be efficient if and only if it performs better resource allocation even in case of resource failure. Allocation of resources is a tedious issue since it has to consider several requirements such as system load, processing cost and time, user’s deadline, and resource failure. This work attempts to design a resource allocation algorithm which is budget constrained and also targets load balancing, fault tolerance, and user satisfaction by considering the above requirements. The proposed Multiconstrained Load Balancing Fault Tolerant algorithm (MLFT) reduces the schedule makespan, schedule cost, and task failure rate and improves resource utilization. The proposed MLFT algorithm is evaluated using Gridsim toolkit and the results are compared with the recent algorithms which separately concentrate on all these factors. The comparison results ensure that the proposed algorithm works better than its counterparts.


Author(s):  
M. Chaitanya ◽  
K. Durga Charan

Load balancing makes cloud computing greater knowledgeable and could increase client pleasure. At reward cloud computing is among the all most systems which offer garage of expertise in very lowers charge and available all the time over the net. However, it has extra vital hassle like security, load administration and fault tolerance. Load balancing inside the cloud computing surroundings has a large impact at the presentation. The set of regulations relates the sport idea to the load balancing manner to amplify the abilties in the public cloud environment. This textual content pronounces an extended load balance mannequin for the majority cloud concentrated on the cloud segregating proposal with a swap mechanism to select specific strategies for great occasions.


Open Physics ◽  
2020 ◽  
Vol 18 (1) ◽  
pp. 439-447
Author(s):  
Lijie Yan ◽  
Xudong Liu

AbstractTo a large extent, the load balancing algorithm affects the clustering performance of the computer. This paper illustrated the common load balancing algorithms and elaborated on the advantages and drawbacks of such algorithms. In addition, this paper provides a kind of balancing algorithm generated on the basis of the load prediction. Due to the dynamic exponential smoothing model, such an algorithm helps obtain the corresponding smoothing coefficient with the server node load time series of current phrase and allows researchers to make prediction with the load value at the next moment of this node. Subsequently, the dispatcher makes the scheduling with the serve request of users according to the load predicted value. OPNET Internet simulated software is applied to the test, and we may conclude from the results that the application of such an algorithm acquires a higher load balancing efficiency and better load balancing effect.


IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Dalia Abdulkareem Shafiq ◽  
NZ Jhanjhi ◽  
Azween Abdullah ◽  
Mohammed A AlZain

Sign in / Sign up

Export Citation Format

Share Document