Advertisement

Review of Placement Work

  • Majid Sarrafzadeh
  • Maogang Wang
  • Xiaojian Yang
Chapter

Abstract

In this chapter we will review previous placement algorithms. First we review algorithms for partitioning problem, which is tightly related to placement problem. Then we discuss constructive and iterative placement methods. Next we review popular placement algorithms mainly for wirelength minimization. Then we review some approaches for detailed placement, and give an overview for existing congestion-driven and timing-driven placement techniques.

Keywords

Critical Path Steiner Tree Placement Problem Placement Algorithm Congestion Cost 
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.

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