Improving Extremal Optimization in Load Balancing by Local Search

  • Ivanoe De Falco
  • Eryk LaskowskiEmail author
  • Richard Olejnik
  • Umberto Scafuri
  • Ernesto Tarantino
  • Marek Tudruj
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8602)


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.


Distributed program design Extremal optimization Load balancing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Boettcher, S., Percus, A.G.: Extremal optimization: methods derived from coevolution. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), pp. 825–832. Morgan Kaufmann, San Francisco (1999)Google Scholar
  2. 2.
    Olejnik, R., De Falco, I., Laskowski, E., Scafuri, U., Tarantino, E., Tudruj, M.: Load Balancing in Distributed Applications Based on Extremal Optimization. In: Esparcia-Alcázar, A.I. (ed.) EvoApplications 2013. LNCS, vol. 7835, pp. 52–61. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  3. 3.
    Barker, K., Chrisochoides, N.: An evaluation of a framework for the dynamic load balancing of highly adaptive and irregular parallel applications In: Proceedings of the ACM/IEEE Conference on Supercomputing, Phoenix. ACM Press (2003)Google Scholar
  4. 4.
    Willebeek-LeMair, M.H., Reeves, A.P.: Strategies for dynamic load balancing on highly parallel computers. IEEE Trans. on Parallel and Distributed Systems 4, 979–993 (1993)Google Scholar
  5. 5.
    Xu, C., Francis, C., Lau, M.: Load balancing in parallel computers: Theory and Practice. Kluwer Academic Publishers, Norwell (1997)Google Scholar
  6. 6.
    Khan, R.Z., Ali, J.: Classification of task partitioning and load balancing strategies in distributed parallel computing systems. International Journal of Computer Applications 60(17), 48–53 (2012)Google Scholar
  7. 7.
    Munetomo, M., Takai, M.N.K., Sato, Y.: A stochastic genetic algorithm for dynamic load balancing in distributed systems. In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, vol. 4, pp. 3795–3799. IEEE Press (1995)Google Scholar
  8. 8.
    Zomaya, A.Y., Teh, Y.-H.: Observations on using genetic algorithms for dynamic load-balancing. IEEE Trans. on Parallel and Distributed Systems 12(9), 899–911 (2001)Google Scholar
  9. 9.
    Uyar, A.S., Harmanci, A.E.: Application of an improved diploid genetic algorithm for optimizing performance through dynamic load balancing. In: Proceedings of 2002 WSEAS International Conferences. WSEAS Press (2002)Google Scholar
  10. 10.
    Lin, C.-C., Deng, D.-J.: Dynamic load balancing in cloud-based multimedia system using genetic algorithm. Chang, R.-S., et al (eds.) Advances in Intelligent Systems & Applications, SIST 20, pp. 461–470. Springer, Heidelberg (2013)Google Scholar
  11. 11.
    Mishra, M., Agarwal, S., Mishra, P., Singh, S.: Comparative analysis of various evolutionary techniques of load balancing: a review. International Journal of Computer Applications 63(15) (2013)Google Scholar
  12. 12.
    Sneppen, K., et al.: Evolution as a self-organized critical phenomenon. Proc. Natl. Acad. Sci. 92, 5209–5213 (1995)CrossRefGoogle Scholar
  13. 13.
    Karypis, G., Kumar, V.: Multilevel graph partitioning schemes. In: Proc. 24th Intern. Conf. Par. Proc., III. pp. 113–122. CRC Press (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Ivanoe De Falco
    • 1
  • Eryk Laskowski
    • 2
    Email author
  • Richard Olejnik
    • 3
  • Umberto Scafuri
    • 1
  • Ernesto Tarantino
    • 1
  • Marek Tudruj
    • 2
    • 4
  1. 1.Institute of High Performance Computing and NetworkingCNRNaplesItaly
  2. 2.Institute of Computer SciencePolish Academy of SciencesWarsawPoland
  3. 3.Computer Science LaboratoryUniversity of Science and Technology of LilleVilleneuve-d’AscqFrance
  4. 4.Polish-Japanese Institute of Information TechnologyWarsawPoland

Personalised recommendations