Synonyms
Analytical placement; EDA; Layout; Mathematical programming; Min-cost max-flow; Min-cut placement; Netlist
Years and Authors of Summarized Original Work
-
2000; Caldwell, Kahng, Markov
-
2006; Kennings, Vorwerk
-
2012; Kim, Lee, Markov
Problem Definition
This problem is concerned with determining constrained positions of objects while minimizing a measure of interconnect between the objects, as in physical layout of integrated circuits, commonly done in 2 dimensions. While most formulations are NP-hard, modern circuits are so large that practical placement algorithms must have near-linear run time and memory requirements, but not necessarily produce optimal solutions. Research in placement algorithms has identified scalable techniques which are now being adopted in the electronic design automation industry.
One models a circuit by a hypergraph G h (V h , E h ) with (i) vertices V h = { v1, …, v n } representing logic gates, standard cells, larger modules, or fixed I/O pads and (ii)...
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
Recommended Reading
Alpert CJ, Chan T, Kahng AB, Markov IL, Mulet P (1998) Faster minimization of linear wirelength for global placement. IEEE Trans CAD 17(1):3–13
Caldwell AE, Kahng AB, Markov IL (2000) Optimal partitioners and end-case placers for standard-cell layout IEEE Trans CAD 19(11):1304–1314
Chan T, Cong J, Sze K (2005) Multilevel generalized force-directed method for circuit placement. In: Proceedings of international symposium on physical design, San Francisco, pp 185–192
Crescenzi P, Kann V (1998) A compendium of NP optimization problems. Springer, Berlin/ Heidelberg
Kahng AB, Wang Q (2005) Implementation and extensibility of an analytic placer. IEEE Trans CAD 24(5):734–747
Kennings A, Markov IL (2002) Smoothing max-terms and analytical minimization of half-perimeter wirelength. VLSI Design 14(3):229–237
Kennings A, Vorwerk K (2006) Force-directed methods for generic placement. IEEE Trans CAD 25(10):2076–2087
Kim M-C, Lee D, Markov IL (2012) SimPL: an effective placement algorithm. IEEE Trans CAD 31(1):50–60
Lin T, Chu C, Shinnerl JR, Bustany I, Nedelchev I (2013) POLAR: placement based on novel rough legalization and refinement. In: International conference on computer-aided design, San Jose, pp 357–362
Papa DA, Markov IL (2007) Hypergraph partitioning and clustering. In: Gonzalez T (ed) Approximation algorithms and metaheuristics. Chapman & Hall/CRC computer and information science series. Chapman & Hall/CRC, Florida
Reda S, Chowdhary A (2006) Effective linear programming based placement methods. In: International symposium on physical design, San Jose, pp 186–191
Roy JA, Adya SN, Papa DA, Markov IL (2006) Min-cut floorplacement. IEEE Trans CAD 25(7):1313–1326
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Kennings, A.A., Markov, I.L. (2016). Circuit Placement. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_69
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_69
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering