• DocumentCode
    3556168
  • Title

    The min-cut shuffle: toward a solution for the global effect problem of min-cut placement

  • Author

    Bhandari, Inderpal ; Hirsch, Michele ; Slewiorek, D.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Carnegie-Mellon Univ., Pittsburgh, PA, USA
  • fYear
    1988
  • fDate
    12-15 Jun 1988
  • Firstpage
    681
  • Lastpage
    685
  • Abstract
    The global effect problem is introduced in the context of adapting min-cut partitioning for min-cut placement. A simplified version of the problem is solved in linear time by using a novel algorithm called the min-cut shuffle. A detailed analysis and implementation for the algorithm is presented
  • Keywords
    circuit layout CAD; data structures; network topology; global effect problem; layout design; linear time; min-cut partitioning; min-cut placement; min-cut shuffle; Algorithm design and analysis; Circuits; Clustering algorithms; Minimization; Pain; Partitioning algorithms; Routing; Wires;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design Automation Conference, 1988. Proceedings., 25th ACM/IEEE
  • Conference_Location
    Anaheim, CA
  • ISSN
    0738-100X
  • Print_ISBN
    0-8186-0864-1
  • Type

    conf

  • DOI
    10.1109/DAC.1988.14842
  • Filename
    14842