Skip to main content
SpringerLink
Log in

Distributed mapping of SPMD programs with a generalized Kernighan-Lin heuristic

  • Doain Decomposion in Engineering
  • Conference paper
  • First Online:
Book cover High-Performance Computing and Networking (HPCN-Europe 1994)

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

Included in the following conference series:

Abstract

Mapping a parallel algorithm onto a parallel computer is known to be NP-hard. In this paper we propose a parallel mapping technique based on a generalization of the Kernighan-Lin heuristic. The properties of a mapping cost function are thereby exploited.

This work was supported by FKFO grant nr. 9.008.91N (Lotto) and the Belgian incentive programme on Interuniversitary Poles of Attraction (IUAP 17), initiated by the Belgian State - Prime Minister's Service - Science Policy Office. The scientific responsibility is assumed by its authors.

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. J. De Keyser and D. Roose. Incremental mapping for solution-adaptive multigrid hierarchies. In Proceedings of the Scalable High Performance Computing Conference '92, pages 401–408. IEEE Computer Society Press, 1992.

    Google Scholar 

  2. J. De Keyser and D. Roose. Distributed mapping of SPMD programs with a generalized Kernighan-Lin heuristic. Report TW XYZ, K. U. Leuven, Leuven, Belgium, 1994.

    Google Scholar 

  3. B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell Systems Tech. J., 49(2):291–308, 1970.

    Google Scholar 

  4. P. Sadayappan, F. Ercal, and J. Ramanujam. Cluster partitioning approaches to mapping parallel programs onto a hypercube. Parallel Computing, 13(1):1–16, 1990.

    Article  Google Scholar 

  5. P. Sadayappan, F. Ercal, and J. Ramanujam. Parallel graph partitioning on a hypercube. In J. Gustafson, editor, Proceedings of the 4th Distributed Memory Computing Conference, pages 67–70. Golden Gate Enterprise, CA, 1990.

    Google Scholar 

  6. R. Van Driessche and R. Piessens. Parallel graph partitioning with the Kernighan-Lin heuristic. Report TW 203, K. U. Leuven, Leuven, Belgium, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, K.U.Leuven, Belgium

    Johan De Keyser & Dirk Roose

Authors
  1. Johan De Keyser
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dirk Roose
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Gentzsch Uwe Harms

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Keyser, J., Roose, D. (1994). Distributed mapping of SPMD programs with a generalized Kernighan-Lin heuristic. In: Gentzsch, W., Harms, U. (eds) High-Performance Computing and Networking. HPCN-Europe 1994. Lecture Notes in Computer Science, vol 797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57981-8_123

Download citation

  • DOI: https://doi.org/10.1007/3-540-57981-8_123

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation