The rapid advance of VLSI technology has created an increasing demand for highquality placement tools. A placer has to deliver solutions that meet all the design requirements in a rapid fashion without wasting any computational resources. The nanometer technology makes it possible to integrate billions of transistors in a single chip. Such a design complexity, combined with the increasingly stringent market pressure, requires a very efficient implementation of the placement algorithms. A modern design scenario usually involves several iterations between the logic synthesis and physical design before timing closure can be achieved. From a design iteration point of view, an efficient placement algorithm is essential. Moreover, shrinking feature sizes introduce a full spectrum of deep submicron effects, such as interconnect dominance, crosstalk, IR drop, etc., which challenge the chip designers more than ever before. A placer needs to address explicitly timing, congestion, signal integrity, etc., so that the design can be signed off in a timely manner to meet the shrinking market window.
Keywords
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chang C, Cong J, Pan Z, Yuan X (2002) Physical hierarchy generation with routing congestion control. Proc. International symposium on physical design, pp 36-41
Chang C, Cong J, Romesis M, Xie M (2004) Optimality and scalability study of existing placement algorithms. J IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 23, pp 537-549
Donath WE (1979) Placement and average interconnection lengths of computer logic. J IEEE Transactions on Circuits and Systems, vol. CAS-26, pp 272-277
Eisenmann H, Johannes FM (1998) Generic global placement and floor planning. Proc. Design Automation Conference, pp 269-274
Etawil H, Areibi S, Vannelli A (1999) Attractor-repeller approach for global placement. Proc. International Conference on Computer-Aided Design, pp 20-24
Hu B, Marek-Sadowska M (2002) FAR: fixed point addition and relaxation based placement. Proc. International Symposium on Physical Design, pp 161-166
Hu B, Marek-Sadowska M (2003) Wire length prediction based clustering and its application in placement. Proc. Design Automation Conference, pp 800-805
Karypis G, Aggarwal R, Kumar V, Shekhar S (1997) Multilevel hypergraph partitioning: application in VLSI domain. Proc. Design Automation Conference, pp 526-529
Kleinhans JM, Sigl G, Johannes FM, Antreich KJ (1991) GORDIAN: VLSI placement by quadratic programming and slicing optimization. J IEEE Transactions on ComputerAided Design of Integrated Circuits and Systems, vol 10, issue 3, pp 356-365
Sigl G, Doll K, Johannes F (1991) Analytical placement: a linear or a quadratic objective function. Proc. Design Automation Conference, pp 427-432
Tsay RS, Kuh E, Hsu CP (1988) PROUD: A sea-of-gates placement algorithm. J IEEE Design & Test of Computers, vol. 5, issue 6, pp 44-56
Viswanathan N, Chu CN (2005) FastPlace: efficient analytical placement using cell shifting, iterative local refinement and a hybrid net model. J IEEE Transactions on ComputerAided Design of Integrated Circuits and Systems, vol. 24, issue 5, pp 722-733
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Hu, B., Marek-Sadowska, M. (2007). mFAR: Multilevel Fixed-Points Addition-Based VLSI Placement. In: Nam, GJ., Cong, J. (eds) Modern Circuit Placement. Series on Integrated Circuits and Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-68739-1_9
Download citation
DOI: https://doi.org/10.1007/978-0-387-68739-1_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-36837-5
Online ISBN: 978-0-387-68739-1
eBook Packages: EngineeringEngineering (R0)