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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Sarrafzadeh, M., Wang, M., Yang, X. (2003). Review of Placement Work. In: Modern Placement Techniques. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3781-3_2
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3781-3_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5309-4
Online ISBN: 978-1-4757-3781-3
eBook Packages: Springer Book Archive