Skip to main content
SpringerLink
Log in

Circuit Placement

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 81 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. 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

    Article  Google Scholar 

  2. Caldwell AE, Kahng AB, Markov IL (2000) Optimal partitioners and end-case placers for standard-cell layout IEEE Trans CAD 19(11):1304–1314

    Article  Google Scholar 

  3. 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

    Google Scholar 

  4. Crescenzi P, Kann V (1998) A compendium of NP optimization problems. Springer, Berlin/ Heidelberg

    Google Scholar 

  5. Kahng AB, Wang Q (2005) Implementation and extensibility of an analytic placer. IEEE Trans CAD 24(5):734–747

    Article  Google Scholar 

  6. Kennings A, Markov IL (2002) Smoothing max-terms and analytical minimization of half-perimeter wirelength. VLSI Design 14(3):229–237

    MathSciNet  Google Scholar 

  7. Kennings A, Vorwerk K (2006) Force-directed methods for generic placement. IEEE Trans CAD 25(10):2076–2087

    Article  Google Scholar 

  8. Kim M-C, Lee D, Markov IL (2012) SimPL: an effective placement algorithm. IEEE Trans CAD 31(1):50–60

    Article  Google Scholar 

  9. 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

    Google Scholar 

  10. 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

    Google Scholar 

  11. Reda S, Chowdhary A (2006) Effective linear programming based placement methods. In: International symposium on physical design, San Jose, pp 186–191

    Google Scholar 

  12. Roy JA, Adya SN, Papa DA, Markov IL (2006) Min-cut floorplacement. IEEE Trans CAD 25(7):1313–1326

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada

    Andrew A. Kennings

  2. Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA

    Igor L. Markov

Authors
  1. Andrew A. Kennings
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Igor L. Markov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrew A. Kennings .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation