Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Problem Solving from Nature

PPSN 1990: Parallel Problem Solving from Nature pp 170–175Cite as

Solving the mapping-problem — Experiences with a genetic algorithm

  • Genetic Algorithms
  • Conference paper
  • First Online:

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

Abstract

The specific problem to solve was the mapping of asynchronous cooperating processes (UNITY statements) to an arbitrary parallel architecture. The algorithm should neither need any user interaction nor we would rely on heuristics. A (λ,μ)-evolution met our intentions and has been implemented in Modula-P. A locally working optimizer lead to good mapping solutions.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Bieler: Partitioning Programs into Processes, to be published in Proceedings of ‘Joint Conference on Vector and Parallel Processing 1990’ Springer Verlag Heidelberg

    Google Scholar 

  2. K.M. Chandy and J. Misra: Parallel Program Design — A Foundation. Addison-Wesley, 1988

    Google Scholar 

  3. H. Mühlenbein, M. Gorges-Schleuter, O. Krämer: New solutions to the mapping problem of parallel systems: The evolution approach, Parallel Computing 4 (1987) 269–279

    Article  Google Scholar 

  4. H. Mühlenbein: Parallel Genetic Algorithms, Population Genetics and Combinatorial Optimization, Proceedings of ‘3rd International Conference on Genetic Algorithms’ Morgan Kaufmann 1989

    Google Scholar 

  5. P. Neuhaus: Implementierung eines genetischen Algorithmus zur Lösung des Mapping-Problems, Studienarbeit Universität Karlsruhe 1990

    Google Scholar 

  6. H.P. Schwefel: Numerische Optimierung von Computer-Modellen mittels der Evolutionstheorie, Basel 1977

    Google Scholar 

  7. H.P. Schwefel: Natürliche Intelligenz in evolutionären Systemen, Dortmund

    Google Scholar 

  8. J. Vollmer: Kommunizierende sequentielle Prozesse in Modula-2, GMD Forschungsstelle an der Universität Karlsruhe 1989

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GMD Forschungsstelle an der Universität Karlsruhe, Vincent-Prießnitz Str.1, D-7500, Karlsruhe 1

    Peter Neuhaus

Authors
  1. Peter Neuhaus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans-Paul Schwefel Reinhard Männer

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Neuhaus, P. (1991). Solving the mapping-problem — Experiences with a genetic algorithm. In: Schwefel, HP., Männer, R. (eds) Parallel Problem Solving from Nature. PPSN 1990. Lecture Notes in Computer Science, vol 496. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029749

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-70652-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation