Applying Genetic Algorithms to the Load-Balancing Problem

  • Alex Alves Freitas
  • Junia Coutinho Anacleto
  • Claudio Kirner

Abstract

In the Parallel Processing literature, the Load-Balancing Problem consists of distributing evenly a set of tasks among the processors of a parallel machine or a distributed system, so that the total execution time of all tasks is minimized. Hence, we want to minimize the parallel processing time (PPT) of a set of n tasks — each of them with a previously-known execution time — on m processors (m ≥ 2 and n > m), given by the following objective function:
$$ PPT = \max \left\{ {T_i } \right\},i = 1,2, \ldots n, $$
where Ti is the processing time assigned to processor i, that is the total execution time of all tasks scheduled to processor i.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bellman, R., Esogbue, A.O., and Nabeshima, I., 1982, “Mathematical Aspects of Scheduling and Applications,” Pergamon Press, Oxford.MATHGoogle Scholar
  2. Bruno, J., Coffman Jr., E.G., and Sethi., R., 1974, Scheduling independent tasks to reduce mean finishing time, Communications of the ACM, Vol.17, No.7, pp.382–387.MathSciNetMATHCrossRefGoogle Scholar
  3. Cleveland, G.A. and Smith, S.F., 1989, Using genetic algorithms to schedule flow shop releases, in: Proc. 3rd Int’l Conf. Genetic Algorithms, pp. 160-169.Google Scholar
  4. Davies, L., 1991, “Handbook of Genetic Algorithms,” Van Nostrand Reinhold, New York.Google Scholar
  5. Goldberg, D.E., 1989, “Genetic Algorithms in Search, Optimization & Machine Learning,” Addison-Wesley, Reading, Mass.MATHGoogle Scholar
  6. Grefenstette, J.J., 1986, Optimization of control parameters for genetic algorithms, IEEE Trans. Systems, Man, and Cybernetics, Vol. SMC-16, No. 1, pp. 122–128.CrossRefGoogle Scholar
  7. Grefenstette, J.J., Gopal, R., Rosmaita, B.J., and Van Gutch, D., 1985, Genetic algorithms for the traveling salesman problem, in: Proc. Int’l Conf. Genetic Algorithms and their Applications, pp. 160-168.Google Scholar
  8. Hilliard, M.R., Liepins, G.E., Palmer, M., Morrow, M., and Richardson, J., 1987, A classifier-based system for discovering scheduling heuristics, in: Proc. 2nd Int’l Conf. Genetic Algorithms, pp. 231-235.Google Scholar
  9. Husbands, P., Mill, F., and Warrington, S., 1990, Genetic algorithms, production plan optimization and scheduling, in: Proc. 1st Workshop on Parallel Problem Solving from Nature (published as Lecture Notes on Computer Science, No. 496, pp. 80-84).Google Scholar
  10. Sahni, S.K., 1976, Algorithms for scheduling independent tasks, in: Journal of the ACM, Vol.23, No.1, pp. 116–127.MathSciNetMATHCrossRefGoogle Scholar
  11. Suh, J.Y., and Van Gutch, D., 1987, Incorporating heuristic information into genetic search, in: Proc. 2nd Int’l Conf. Genetic Algorithms, pp. 100-107.Google Scholar

Copyright information

© Springer Science+Business Media New York 1994

Authors and Affiliations

  • Alex Alves Freitas
    • 1
  • Junia Coutinho Anacleto
    • 1
  • Claudio Kirner
    • 1
  1. 1.Departamento de ComputacaoUniversidade Federal de Sao CarlosSao CarlosBrazil

Personalised recommendations