Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computational Science and Its Applications

ICCSA 2005: Computational Science and Its Applications – ICCSA 2005 pp 269–279Cite as

Real-Coded Genetic Algorithms for Optimal Static Load Balancing in Distributed Computing System with Communication Delays

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3483))

Abstract

We consider the problem of static load balancing with the objective of minimizing the job response times. The jobs that arrive at a central scheduler are allocated to various processors in the system with certain probabilities. This optimization problem is solved using real-coded genetic algorithms. A comparison of this approach with the standard optimization methods are presented.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Buzen, J.P., Chen, P.P.S.: Optimal load balancing in memory hierarchies. Information Processing 74, 271–275 (1974)

    Google Scholar 

  2. Piepmeier, W.F.: Optimal balancing of I/O requests to disks. Communications of the ACM 18(9), 524–527 (1975)

    Article  MATH  Google Scholar 

  3. Agrawala, A.K., Tripathi, S.K., Ricart, G.: Adaptive routing using a virtual waiting time technique. IEEE Trans. on Software Engineering 8(1), 76–81 (1981)

    Article  Google Scholar 

  4. Ni, L.M., Hwang, K.: Optimal load balancing in a multiple processor system with many job classes. IEEE Trans. on Software Engineering 11(5), 491–496 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  5. Stankovic, J.A.: An application of bayesian decision theory to decentralized control of job scheduling. IEEE Trans. on Computers 34(2), 117–130 (1985)

    Article  MathSciNet  Google Scholar 

  6. Tantawi, A.N., Towsley, D.: Optimal static load balancing in distributed computer systems. Journal of the Asso. for Computing Machinery 32(2), 445–465 (1985)

    MATH  MathSciNet  Google Scholar 

  7. Kim, C., Kameda, H.: An algorithm for optimal static load balancing in distributed computer systems. IEEE Trans. on Computers 41(3), 381–384 (1992)

    Article  Google Scholar 

  8. Li, J., Kameda, H.: A decomposition algorithm for optimal static load balancing in tree hierarchy network configurations. IEEE Trans. on Parallel and Distributed Systems 5(5), 540–548 (1994)

    Article  Google Scholar 

  9. Li, J., Kameda, H.: Load balancing problems for multiclass jobs in distributed/parallel computer systems. IEEE Trans. on Computers 47(3), 322–332 (1998)

    Article  MathSciNet  Google Scholar 

  10. Holland, H.J.: Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  11. Goldberg, D.E.: Genetic algorithms in search, optimization and machine learning. Addison-Wesley, New York (1989)

    MATH  Google Scholar 

  12. David, L.: Handbook of Genetic Algorithms, New York (1991)

    Google Scholar 

  13. Michalewicz, Z.: Genetic algorithms + Data structures = Evolution programs. AI Series. Springer, New York (1994)

    MATH  Google Scholar 

  14. Houck, C.R., Joines, J.A., Kay, M.G.: A genetic algorithm for function optimization: A Matlab implementation. ACM Trans. on Mathematical Software 22, 1–14 (1996)

    Article  Google Scholar 

  15. Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. on Evolutionary Computation 1(1), 67–82 (1997)

    Article  Google Scholar 

  16. Herrera, F., Lozano, M., Sanchez, A.M.: Hybrid crossover operators for real-coded genetic algorithms: An experimental study. Soft Computing - A Fusion of Foundations, Methodologies and Applications (2002)

    Google Scholar 

  17. Herrera, F., Lozano, M., Verdegay, J.L.: Tackling real-coded genetic algorithms: Operators and tools for behavioural analysis. Artificial Intelligence Review 12(4), 265–319 (1998)

    Article  MATH  Google Scholar 

  18. Goldberg, D.E.: Real-coded genetic algorithms virtual alphabets, and blocking. Complex Systems 5, 139–167 (1991)

    MATH  MathSciNet  Google Scholar 

  19. Lagarias, J.C., Reeds, J.A., Wright, M.H., Wright, P.E.: Convergence properties of the Nelder-Mead simplex method in low dimensions. SIAM Journal of Optimization 9(1), 112–147 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  20. Shanno, D.F.: Conditioning of Quasi-Newton methods for function minimization. Mathematics of Computing 24, 647–656 (1970)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Aerospace Engineering, Indian Institute of Science, Bangalore, India

    V. Mani & S. Suresh

  2. Department of Control and Instrumentation Engineering, Kangwon National University, Chunchon, 200-701, Korea

    H. J. Kim

Authors
  1. V. Mani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Suresh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. J. Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mani, V., Suresh, S., Kim, H.J. (2005). Real-Coded Genetic Algorithms for Optimal Static Load Balancing in Distributed Computing System with Communication Delays. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424925_30

Download citation

  • DOI: https://doi.org/10.1007/11424925_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25863-6

  • Online ISBN: 978-3-540-32309-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation