Skip to main content
Article thumbnail
Location of Repository

Taming the Complexity of Coordinated Place and Route

By Jin Hu, Myung-chul Kim and Igor L. Markov

Abstract

IC performance, power dissipation, size, and signal integrity are now dominated by interconnects. However, with ever-shrinking standard cells, blind minimization of interconnect during placement causes routing failures. Hence, we develop Coordinated Placeand-Route (CoPR) with (i) a Lightweight Incremental Routing Estimation (LIRE) frequently invoked during placement, (ii) placement techniques that address three types of routing congestion, and (iii) an interface to congestion estimation that supports new types of incrementality. LIRE comprehends routing obstacles and nonuniform routing capacities, and relies on a cache-friendly, fullyincremental routing algorithm. Our implementation extends and improves our winning entry at the ICCAD 2012 Contest. 1

Year: 2014
OAI identifier: oai:CiteSeerX.psu:10.1.1.417.2067
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://web.eecs.umich.edu/~ima... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.