Advertisement

White Space Allocation

  • Majid Sarrafzadeh
  • Maogang Wang
  • Xiaojian Yang
Chapter

Abstract

Congestion is an important indicator of routability in placement, and it has become dominant for large, tight designs. Previous works addressed the congestion problem using various methods. Mayrhofer and Lauther [105] combine congestion function in cut minimization. Cheng [30] employs a congestion model in simulated annealing approach. Wang et. al [160] propose a post-processing step to remove congestion for a wirelength optimized placement. These methods attempt to reduce congestion by obtaining a placement with less gathered wires and are successful for improving routability.

Keywords

Simulated Annealing White Space Allocation Approach Placement Process Placement Flow 
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.

Notes

  1. 1.
    The reason of bounding white space in rows will be discussed in Section 6.2Google Scholar

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Majid Sarrafzadeh
    • 1
  • Maogang Wang
    • 2
  • Xiaojian Yang
    • 1
  1. 1.Computer Science DepartmentUniversity of CaliforniaLos AngelesUSA
  2. 2.Cadence Design Systems, Inc.USA

Personalised recommendations