Skip to main content
Springer Nature Link
Log in

A stochastic algorithm for circuit bi-partitioning

  • Track 9: VLSI Design
  • Conference paper
  • First Online:
Computing in the 90's (Great Lakes CS 1989)

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

Included in the following conference series:

  • 118 Accesses

Abstract

Circuit bi-partitioning is an important step in placement algorithms based on the min-cut paradigm. In this paper, we present a stochastic algorithm for circuit bi-partitioning (BIPART) which minimizes the number of nets cut while maintaining a tight control on the sizes of the two parts. BIPART performs better than simulated annealing and the Fiduccia-Matheyses algorithm, and runs in linear time per iteration.

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. A. Dunlop and B. Kernighan, "A Procedure for Placement of Standard-Cell VLSI Circuits," IEEE Trans. Computer-Aided Design, vol. CAD-4, no. 1, pp. 92–98, Jan. 1985.

    Article  Google Scholar 

  2. D. La Potin and S. Director, "Mason: A Global Floorplanning Approach for VLSI Design," IEEE Trans. Computer-Aided Design, vol. CAD-5, no. 4, pp. 477–489, Oct. 1986.

    Article  Google Scholar 

  3. M. Breuer, "Min-Cut Placement," J. Design Automation and Fault-Tolerant Computing, vol. 1, no. 4, pp. 343–362, Oct. 1977.

    Google Scholar 

  4. B. W. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs," Bell System Technical Journal, vol. 49, pp. 291–307, February 1970.

    MATH  Google Scholar 

  5. Earl E. Barnes, "An Algorithm for Partitioning the Nodes of a Graph," IBM Technical Report RC8690, 1981.

    Google Scholar 

  6. C. M. Fiduccia and R. M. Mattheyses, "A Linear-Time Heuristics for Improving Network Partitions," Proceedings of the 19th Design Automation Conference, pp. 175–181, January 1982.

    Google Scholar 

  7. D. Schweikert and B. Kernighan, "A Proper Model for the Partitioning of Electrical Circuits," Proceedings of the 9th Design Automation Workshop, pp. 57–62, 1972.

    Google Scholar 

  8. S. Nahar, S. Sahni, and E. Shragowitz, "Simulated Annealing and Combinatorial Optimization," Proc. 23rd Design Automation Conference, pp. 293–299, June 1986.

    Google Scholar 

  9. Y. G. Saab and V. B. Rao, "Some NP-Complete Problems in the Physical Design of Digital Integrated Circuits," Report UILU-ENG-90-2218, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, June 1990.

    Google Scholar 

  10. S. Kirkpatrick, C. Gelatt, and M. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671–680, May 1983.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Coordinated Science Laboratory and Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, 1101 W. Springfield Avenue, 61801, Urbana, Illinois

    Youssef Saab & Vasant Rao

Authors
  1. Youssef Saab
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vasant Rao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Naveed A. Sherwani Elise de Doncker John A. Kapenga

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saab, Y., Rao, V. (1991). A stochastic algorithm for circuit bi-partitioning. In: Sherwani, N.A., de Doncker, E., Kapenga, J.A. (eds) Computing in the 90's. Great Lakes CS 1989. Lecture Notes in Computer Science, vol 507. Springer, New York, NY. https://doi.org/10.1007/BFb0038509

Download citation

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

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97628-0

  • Online ISBN: 978-0-387-34815-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics