HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Improving Extremal Optimization in Load Balancing by Local Search

Abstract : The paper concerns the use of Extremal Optimization (EO) technique in dynamic load balancing for optimized execution of distributed programs. EO approach is used to periodically detect the best candidates for task migration leading to balanced execution. To improve the quality of load balancing and decrease time complexity of the algorithms, we have improved EO by a local search of the best computing node to receive migrating tasks. The improved guided EO algorithm assumes a two-step stochastic selection based on two separate fitness functions. The functions are based on specific program models which estimate relations between the programs and the executive hardware. The proposed load balancing algorithm is compared against a standard EO-based algorithm with random placement of migrated tasks and a classic genetic algorithm. The algorithm is assessed by experiments with simulated load balancing of distributed program graphs and analysis of the outcome of the discussed approaches.
Complete list of metadata

Contributor : Richard Olejnik Connect in order to contact the contributor
Submitted on : Monday, December 14, 2015 - 3:56:13 PM
Last modification on : Wednesday, March 23, 2022 - 3:51:16 PM



Ivanoe De Falco, Eryk Laskowski, Richard Olejnik, Umberto Scafuri, Ernesto Tarantino, et al.. Improving Extremal Optimization in Load Balancing by Local Search. Lecture Notes in Computer Science, Springer, 2014, Applications of Evolutionary Computation, 8602, pp.12. ⟨10.1007/978-3-662-45523-4_5⟩. ⟨hal-01243170⟩



Record views