Nothing Special   »   [go: up one dir, main page]

Skip to main content

Parallelization of an iterative placement algorithm using ParMod-C

  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1995)

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

Included in the following conference series:

  • 143 Accesses

Abstract

This paper describes the parallelization of a deterministic iterative method for the placement of standard cell circuits in VLSI design. The programming environment is the implementation of the parallel programming language ParMod-C for workstation clusters. The essential steps for transforming the existing sequential program to a parallel program are shown. An emphasis is laid on the discussion of the usefulness of individual language concepts. The efficiency of the application is investigated by analyzing the speedup and the quality of computed solutions of the parallel program.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Konrad Doll, Frank M. Johannes, and Kurt J. Antreich. Iterative placement improvement by network flow methods. IEEE Transactions on Computer-Aided Design, 13(10):1190–1200, 1994.

    Article  Google Scholar 

  2. Konrad Doll, Frank M. Johannes, and Georg Sigl. Accurate net models for placement improvement by network flow methods. In Proceedings IEEE/ACM International Conference on Computer-Aided Design, ICCAD, pages 594–597, Santa Clara, 1992.

    Google Scholar 

  3. Jürgen M. Kleinhans, Georg Sigl, Frank M. Johannes, and Kurt J. Antreich. GORDIAN: VLSI placement by quadratic programming and slicing optimization. IEEE Transactions on Computer-Aided Design, 10(3):356–365, March 1991.

    Article  Google Scholar 

  4. Thomas Schnekenburger, Andreas Weininger, and Michael Friedrich. Introduction to the parallel and distributed programming language ParMod-C. Technical Report SFB 342/27/91 A, Technische Universität München, October 1991. ftp ftp.informatik.tu-muenchen.de: /local/lehrstuhl/paul/parmod/doc/pmc-report-TUM-I9 139.ps.Z.

    Google Scholar 

  5. A. Weininger, T. Schnekenburger, and M. Friedrich. Parallel and distributed programming with ParMod-C. In First International Conference of the Austrian Center for Parallel Computation, Salzburg, September 1991. Springer, LNCS 591.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bob Hertzberger Giuseppe Serazzi

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schnekenburger, T., Spruth, H. (1995). Parallelization of an iterative placement algorithm using ParMod-C. In: Hertzberger, B., Serazzi, G. (eds) High-Performance Computing and Networking. HPCN-Europe 1995. Lecture Notes in Computer Science, vol 919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0046675

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics