Skip to main content
SpringerLink
Log in

A parallel genetic algorithm for task mapping on parallel machines

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1586))

Included in the following conference series:

Abstract

In parallel processing systems, a fundamental consideration is the maximization of system performance through task mapping. A good allocation strategy may improve resource utilization and increase significantly the throughput of the system. We demonstrate how to map the tasks among the processors to meet performance criteria, such as minimizing execution time or communication delays. We review the Local Neighborhhod Search (LNS) strategy for the mapping problem. We base our approach on LNS since it was shown that this method outperforms a large number of heuristic-based algorithms. We call our mapping algorithm, that is based on LNS, Genetic Local Neighborhood Search (GLNS), and its parallel version, Parallel Genetic Local Neighborhood Search (P-GLNS). We implemented and compared all three of these mapping strategies. The experimental results demonstrate that 1) GLNS algorithm was better performance than LNS and, 2) The P-GLNS algorithm achieves near linear speedup.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benmohammed-Mahieddine, K., P. M. Dew and M. Kara. 1994. A Periodic Symmetrically-initiated Load Balancing Algorithm for Distributed Systems.

    Google Scholar 

  2. Casavant, T. L. and J.G. Kuhl. 1988. “A taxonomy of scheduling in General-purpose Distributed Computing Systems” IEEE Trans. Software Eng., vol. 14, No. 2

    Google Scholar 

  3. Cybenko, G. 1989 “Load balancing for distributed memory multiprocessors” Journal of Parallel and distributed computing. 7: 279–301 1989.

    Article  Google Scholar 

  4. D.E. Goldberg: Genetic Algorithms in search Optimization and Machine learning. Addison Wesley, New York, 1989.

    MATH  Google Scholar 

  5. Eager, D. L., E. D. Lazowska, and J. Zahorjan. 1986. ‘A comparison of receiver initiated and sender initiated adaptive load sharing” Performance evaluation, Vol. 6, 1986, pp. 53–68.

    Article  Google Scholar 

  6. E-G. Talbi, P. Bessiere: Parallel genetic algorithm for the graph partitioning problem. ACM international Conference on SuperComputing, Cologne, Germany, June 1991

    Google Scholar 

  7. Erik Cantu-Paz. A summary of Research on Parallel Genetic Algorithms. Illinois Genetic Algorithms Laboratory http://www-illigal.ge.uiuc.edu/cantupaz/publications.html, 01/20/98.

    Google Scholar 

  8. F. Berman and Bernd Stramm. Mapping Function-Parallel Programs with the Prep-P Automatic Mapping Preprocessor. University of California, San Diego. January 7, 1994.

    Google Scholar 

  9. Grosso, P. (1985). Computer simulations of genetic adaptation: Parallel Subcomponent Interaction in a Multilocus Model. PhD thesis, University of Michigan.

    Google Scholar 

  10. Horton, G. 1993. “A multi-level diffusion method for dynamic load balancing”. Par. Comp. 19, pp. 209–218 (1993). In proc 9th International.

    Article  MATH  Google Scholar 

  11. J. Watts and S. Taylor. A Practical Approach to Dynamic Load Balancing. Submitted to IEEE Transactions on Parallel and Distributed Systems. 1998.

    Google Scholar 

  12. Levine, D. (1994). A parallel genetic algorithm for the set partitionning problem. PhD thesis, Illinois Institute of technology.

    Google Scholar 

  13. Li T. and Mashford J. (1990) A parallel genetic algorithm for quadratic assignement. In R.A. Ammar, editor, Proceedings of the ISMM International Conference. Parallel and Distributed Computing and Systems, pages 391–394, New York, NY: Acta Press, Anaheim, CA.

    Google Scholar 

  14. Marin, F., Trelles-Salazar, O., and Sandoval, F. (1994). Genetic algorithms on lan-message passing architectures using pvm: Application to the routing problem. In Y.Davidor, H-P.Shwefel, and R.Manner, editors, Parallel Problem Solving from Nature-PPSN III volume 866 of Lecture Notes in Computer Science, pages 534–543, Berlin, Germany: Springer-Verlag.

    Google Scholar 

  15. M. R. Garey and D.S. Johnson. Computers and Intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, New York, 1979.

    Google Scholar 

  16. Ni, L. M. and K. Hwang. 1981. “Optimal load balancing strategies for a multiple processors system” in Proc. Int. Conf. Parallel Proc., 1981, pp. 352–357

    Google Scholar 

  17. P.J.M. van Laarhoven and E.H.L. Aarts. Simulated Annealing: Theory and Applications. D. Reidel Publishing Company, Boston, 1987.

    Google Scholar 

  18. S. Mounir Alaoui, A. Bellaachia, A. Bensaid, O. Frieder “A Parallel Genetic Load Balancing Strategy” Cluster Computing Conference-CCC ’97 March 9–11, 1997 Emory University, Atlanta, Georgia.

    Google Scholar 

  19. S. Mounir Alaoui, Master Thesis, Alakhawayn University, Rabat Morocco. June 1997

    Google Scholar 

  20. Shen, C. and W. Tsai. 1985. “A graph matching approach to optimal tasks assignment in distributed computing systems using a minimax criterion” IEEE Trans.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Florida Institute of Technology, Melbourne, Florida, USA

    S. Mounir Alaoui

  2. Illinois Institute of Technology, Chicago, Illinois, USA

    O. Frieder

  3. George Mason University, Washington D.C, USA

    T. El-Ghazawi

Authors
  1. S. Mounir Alaoui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. Frieder
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. T. El-Ghazawi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

José Rolim Frank Mueller Albert Y. Zomaya Fikret Ercal Stephan Olariu Binoy Ravindran Jan Gustafsson Hiroaki Takada Ron Olsson Laxmikant V. Kale Pete Beckman Matthew Haines Hossam ElGindy Denis Caromel Serge Chaumette Geoffrey Fox Yi Pan Keqin Li Tao Yang G. Chiola G. Conte L. V. Mancini Domenique Méry Beverly Sanders Devesh Bhatt Viktor Prasanna

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Alaoui, S.M., Frieder, O., El-Ghazawi, T. (1999). A parallel genetic algorithm for task mapping on parallel machines. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097901

Download citation

  • DOI: https://doi.org/10.1007/BFb0097901

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65831-3

  • Online ISBN: 978-3-540-48932-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation