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.
KeywordsCritical Path Steiner Tree Placement Problem Placement Algorithm Congestion Cost
Unable to display preview. Download preview PDF.