Skip to main content

A Novel Hybrid Approach of Mean Field Annealing and Genetic Algorithm for Load Balancing Problem

  • Conference paper
Advances in Artificial Intelligence – IBERAMIA 2004 (IBERAMIA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3315))

Included in the following conference series:

  • 971 Accesses

Abstract

In this paper, we introduce a new solution for the load balancing problem, which is an important issue in parallel processing. Our novel load balancing technique called MGA is a hybrid algorithm of Mean Field Annealing (MFA) and Simulated annealing-like Genetic Algorithm (SGA). SGA uses the Metropolis criteria for state transition as in simulated annealing to keep the convergence property in MFA. The MGA combines the benefit of both the rapid convergence property of MFA and various and effective genetic operations of SGA. We compare the proposed MGA with MFA and GA. Our experimental results show that our new technique improves performance in terms of communication cost, load imbalance and maximum execution time.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Susmita, S., Bhargab, S., Bhattacharya, B.: Manhattan-diagonal routing in channels and switchboxes. ACM Trans. on DAES 09(01) (2004)

    Google Scholar 

  2. Bultan, T., Aykanat, C.: A New Mapping Heuristic Based on Mean Field Annealing. Journal of Parallel & Distributed Computing 16, 292–305 (1992)

    Article  MATH  Google Scholar 

  3. Heiss, H.-U., Dormanns, M.: Mapping Tasks to Processors with the Aid of Kohonen Network. In: Proc. High Performance Computing Conference, Singapore, pp. 133–143 (1994)

    Google Scholar 

  4. Park, K., Hong, C.E.: Performance of Heuristic Task Allocation Algorithms. Journal of Natural Science, CUK 18, 145–155 (1998)

    Google Scholar 

  5. Salleh, S., Zomaya, A.Y.: Multiprocessor Scheduling Using Mean-Field Annealing. In: Proc. of the First Workshop on Biologically Inspired Solutions to Parallel Processing Problems (BioSP3), pp. 288–296 (1998)

    Google Scholar 

  6. Zomaya, A.Y., Teh, Y.W.: Observations on Using Genetic Algorithms for Dynamic Load- Balancing. IEEE Transactions on Parallel and Distributed Systems 12(9), 899–911 (2001)

    Article  Google Scholar 

  7. Hong, C.E.: Channel Routing using Asynchronous Distributed Genetic Algorithm. Journal of Computer Software & Media Tech., SMU 2 (2003)

    Google Scholar 

  8. Hong, C., McMillin, B.: Relaxing synchronization in distributed simulated annealing. IEEE Trans. on Parallel and Distributed Systems 16(2), 189–195 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hong, C., Kim, W., Kim, Y. (2004). A Novel Hybrid Approach of Mean Field Annealing and Genetic Algorithm for Load Balancing Problem. In: Lemaître, C., Reyes, C.A., González, J.A. (eds) Advances in Artificial Intelligence – IBERAMIA 2004. IBERAMIA 2004. Lecture Notes in Computer Science(), vol 3315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30498-2_83

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30498-2_83

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23806-5

  • Online ISBN: 978-3-540-30498-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics