A discrete PSO-based static load balancing algorithm for distributed simulations in a cloud environment

2021 ◽  
Vol 115 ◽  
pp. 497-516
Author(s):  
Zhang Miao ◽  
Peng Yong ◽  
Yang Mei ◽  
Yin Quanjun ◽  
Xie Xu
Keyword(s):  
Load Balancing ◽  
Static Load ◽  
Cloud Environment ◽  
Distributed Simulations ◽  
Static Load Balancing ◽  
Discrete Pso ◽  
Load Balancing Algorithm

Towards An Implementation of A Modified Static Load Balancing Algorithm To Minimize Execution Time

2019 ◽  
Vol 12 (1) ◽  
pp. 69-74
Author(s):  
Hioual Ouided ◽  
Laskri Mhamed Tayeb ◽  
Hemam Sofiane Mounine ◽  
Hioual Ouassila ◽  
Maifi Lyes
Keyword(s):  
Load Balancing ◽  
Failure Probability ◽  
Execution Time ◽  
Static Load ◽  
Optimal Algorithm ◽  
Scheduling Algorithm ◽  
Static Load Balancing ◽  
Load Balancing Algorithm ◽  
Two Parameters ◽  
The Impact

Purpose: The aim of this article is to discuss the impact of static load balancing over a set of heterogeneous processors, where tasks are independent and unitary in static environments, by showing how to distribute task in order to optimize both the average response time and the degree of the resources used. Methods: Implementation of a modified scheduling algorithm, the latter is based on two parameters which are the execution time and the failure probability. The algorithm is based on the results of an optimal algorithm that already exists, with only one parameter that is execution time. Results: The obtained results show that the modified scheduling algorithm gives us the good results. Conclusion: The modified algorithm assumes that the processor has smallest execute time. So, the failure probability increases because of it’s frequently use. The results obtained by testing this proposed algorithm are better than the optimal algorithm.

AN ADVERSARIAL MODEL FOR DISTRIBUTED DYNAMIC LOAD BALANCING

2002 ◽  
Vol 03 (01n02) ◽  
pp. 35-47 ◽  
Author(s):  
S. MUTHUKRISHNAN ◽  
RAJMOHAN RAJARAMAN
Keyword(s):  
Load Balancing ◽  
Dynamic Load ◽  
Static Load ◽  
Dynamic Load Balancing ◽  
Traffic Patterns ◽  
Analytical Work ◽  
Static Load Balancing ◽  
Load Balancing Algorithm ◽  
Adversarial Model ◽  
New Framework

We study the problem of balancing the load on processors in an arbitrary network. If jobs arrive or depart during the process of load balancing, we have the dynamic load balancing problem; otherwise, we have the static load balancing problem. While static load balancing on a number of different networks has been well-studied, analytical work on dynamic load balancing is limited. The difficulty lies in modeling the arrivals and departures of jobs in a clean manner. In this paper, we introduce a new framework for dynamic load balancing in which the job traffic is modeled by an adversary. Our main result is that a simple local load balancing algorithm maintains the load of the network within a stable level against a powerful adversary. Our result holds for different models of traffic patterns and processor communication.

Efficient Static Load Balancing Algorithm in Cloud Computing

2016 ◽  
Vol 6 (1) ◽  
pp. 1-4
Author(s):  
Senorita Sundarrajan ◽  
◽  
Sherina Sundarrajan ◽  
Varshini. M ◽  
◽  
...  
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Static Load ◽  
Static Load Balancing ◽  
Load Balancing Algorithm
Sign in / Sign up

Export Citation Format

Share Document