Paper Info
Title
Taming the complexity of coordinated place and route
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, fully incremental routing algorithm. Our implementation extends and improves our winning entry at the ICCAD 2012 Contest.
Year
DOI
Venue
2013
10.1145/2463209.2488920
DAC
Keywords
Field
DocType
ic performance,new type,integrated circuit interconnections,network routing,coordinated place-and-route complexity,power dissipation,copr complexity,blind minimization,placement technique,routing congestion,fully-incremental routing algorithm,interconnect blind minimization,failure analysis,routing failures,non-uniform routing capacity,lire,congestion estimation,lightweight incremental routing estimation,ever-shrinking standard cells,signal integrity,placement techniques,fully incremental routing algorithm,embedded systems,multi core processor,spm
Multipath routing,Link-state routing protocol,Dynamic Source Routing,Static routing,Computer science,Policy-based routing,Hierarchical routing,Computer network,Destination-Sequenced Distance Vector routing,Real-time computing,Distributed computing,Zone Routing Protocol
Conference
ISSN
Citations 
PageRank 
0738-100X
13
0.54
References 
Authors
21
3
Name
Order
Citations
PageRank
Jin Hu129914.67
Myung-Chul Kim266557.05
Igor L. Markov33858261.98