Extremal Optimization applied to load balancing in execution of distributed programs

Abstract : The paper describes methods for using Extremal Optimization (EO) for processor load balancing during execution of distributed applications. A load balancing algorithm for clusters of multicore processors is presented and discussed. In this algorithm the EO approach is used to periodically detect the best tasks as candidates for migration and for a guided selection of the best computing nodes to receive the migrating tasks. To decrease the complexity of selection for migration, the embedded EO algorithm assumes a two-step stochastic selection during the solution improvement based on two separate fitness functions. The functions are based on specific models which estimate relations between the programs and the executive hardware. The proposed load balancing algorithm is assessed by experiments with simulated load balancing of distributed program graphs. The algorithm is compared against a greedy fully deterministic approach, a genetic algorithm and an EO-based algorithm with random placement of migrated tasks.
Liste complète des métadonnées

https://hal.inria.fr/hal-01243055
Contributeur : Richard Olejnik <>
Soumis le : lundi 14 décembre 2015 - 14:58:11
Dernière modification le : mardi 3 juillet 2018 - 11:48:03

Identifiants

Collections

Citation

Ivanoe De Falco, Eryk Laskowski, Richard Olejnik, Umberto Scafuri, Ernesto Tarantino, et al.. Extremal Optimization applied to load balancing in execution of distributed programs. Applied Soft Computing, Elsevier, 2015, 30, pp.501-513. 〈http://www.sciencedirect.com/science/journal/15684946〉. 〈10.1016/j.asoc.2015.01.048〉. 〈hal-01243055〉

Partager

Métriques

Consultations de la notice

146