Advertisement

A stochastic algorithm for circuit bi-partitioning

  • Youssef Saab
  • Vasant Rao
Track 9: VLSI Design
Part of the Lecture Notes in Computer Science book series (LNCS, volume 507)

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.

Keywords

Simulated Annealing Design Automation Selection Step Stochastic Algorithm Placement Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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.CrossRefGoogle Scholar
  2. [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.CrossRefGoogle Scholar
  3. [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. [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.zbMATHGoogle Scholar
  5. [5]
    Earl E. Barnes, "An Algorithm for Partitioning the Nodes of a Graph," IBM Technical Report RC8690, 1981.Google Scholar
  6. [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. [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. [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. [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. [10]
    S. Kirkpatrick, C. Gelatt, and M. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671–680, May 1983.MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Youssef Saab
    • 1
  • Vasant Rao
    • 1
  1. 1.Coordinated Science Laboratory and Department of Electrical and Computer EngineeringUniversity of Illinois at Urbana-ChampaignUrbana

Personalised recommendations