A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
An effective congestion driven placement framework
2002
Proceedings of the 2002 international symposium on Physical design - ISPD '02
Preserved Fulltext
In addition, we show how this congestion estimation can be incorporated into a partitioning based placement algorithm. ...
Computational experiments on chips with up to 1,300,000 cells are presented: The framework reduces the usage of the most critical routing edges by 9.0% on average, the running time increase for the placement ...
In this paper, we will introduce a congestion driven placement framework that avoids routing congestion during placement. ...
doi:10.1145/505390.505391
fatcat:klf6ujk4yjeirpleujml3fzwqq
An effective congestion driven placement framework
2002
Proceedings of the 2002 international symposium on Physical design - ISPD '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In addition, we show how this congestion estimation can be incorporated into a partitioning based placement algorithm. ...
Computational experiments on chips with up to 1,300,000 cells are presented: The framework reduces the usage of the most critical routing edges by 9.0% on average, the running time increase for the placement ...
In this paper, we will introduce a congestion driven placement framework that avoids routing congestion during placement. ...
doi:10.1145/505388.505391
dblp:conf/ispd/BrennerR02
fatcat:3ncuerb6svdbje5bc6cj74ky3i
An effective congestion-driven placement framework
2003
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In addition, we show how this congestion estimation can be incorporated into a partitioning based placement algorithm. ...
Computational experiments on chips with up to 1,300,000 cells are presented: The framework reduces the usage of the most critical routing edges by 9.0% on average, the running time increase for the placement ...
In this paper, we will introduce a congestion driven placement framework that avoids routing congestion during placement. ...
doi:10.1109/tcad.2003.809662
fatcat:y67fa7xkwvagfdj5cyvesrtive
IPR: An Integrated Placement and Routing Algorithm
2007
Proceedings - Design Automation Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
efficiently and effectively. ...
We call the proposed algorithm for routing congestion minimization IPR (Integrated Placement and Routing). ...
Comparison with FastPlace shows that the simple congestion-driven approach is effective in improving routability. ...
doi:10.1109/dac.2007.375125
fatcat:obtzew73mjasbp6tbjcrc6gi5y
IPR
2007
Proceedings - Design Automation Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
efficiently and effectively. ...
We call the proposed algorithm for routing congestion minimization IPR (Integrated Placement and Routing). ...
Comparison with FastPlace shows that the simple congestion-driven approach is effective in improving routability. ...
doi:10.1145/1278480.1278496
dblp:conf/dac/PanC07
fatcat:n6vavhuzsfcoherurf4jtubeqy
Ripple: An effective routability-driven placer by iterative cell movement
2011
2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Two major techniques called cell inflation and net-based movement are used in global placement followed by a rough legalization step to reduce congestion. ...
In detailed placement, we use a combination of two kinds of strategy: the traditional HPWL-driven approach and our new congestiondriven approach. ...
Figure 5 : 5 An example to show that the irregular expansion strategy is more effective in reducing congestion in one direction. ...
doi:10.1109/iccad.2011.6105308
dblp:conf/iccad/HeHXTCY11
fatcat:bf6gtrv4q5bvnhijicgyfcz5le
POLAR 2.0: An effective routability-driven placer
2014
2014 51st ACM/EDAC/IEEE Design Automation Conference (DAC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To minimize the routing demand, POLAR 2.0 attaches very high importance to maintaining a good wirelength-driven placement in the global placement stage. ...
A wirelength-driven placer without considering routability would lead to unroutable results. ...
NTU-Place4h formulates routing congestion as an additional constraint into its non-linear programming framework. ...
doi:10.1109/dac.2014.6881450
fatcat:m3f6abigpfcyphdy3uhnnyqyfu
Congestion driven quadratic placement
1998
Proceedings of the 35th annual conference on Design automation conference - DAC '98
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
This paper introduces and demonstrates an extension to quadratic placement that accounts for wiring congestion. ...
The interplay between routing analysis and quadratic placement using a growth matrix permits global treatment of congestion. ...
CONGESTION DRIVEN PLACEMENT
Growing and Shrinking Regions For regions, we define as an diagonal growth matrix with entry equal to the region weight for the independent cell . ...
doi:10.1145/277044.277121
dblp:conf/dac/ParakhBS98
fatcat:u3e7ybofgvghfgjfavwkutdzma
Optimizing routability in large-scale mixed-size placement
2013
2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
The experimental results reveal that our placer improves the routability of the DAC 2012 placement contest designs and effectively reduces the routing congestion. ...
We evaluated the quality of our placer using the newly released DAC 2012 routability-driven placement contest designs and we compared our results to the top four teams that participated in the placement ...
The effect of pre-placement inflation is discussed in Section 7. ...
doi:10.1109/aspdac.2013.6509636
dblp:conf/aspdac/CongLTX13
fatcat:jq3wvpb3zzh5ldbp2zbjojjryi
Congestion-driven regional re-clustering for low-cost FPGAs
2009
2009 International Conference on Field-Programmable Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
This is done by re-packing logic in the affected regions into an increased number of CLBs. This increases the effective amount of interconnect in these high-demand areas. ...
VPR Default uses the default VPR placement algorithm which combines timing-driven and wirelength-driven placement. VPR BB utilizes VPR wirelength-driven placement only. ...
This work shows that an approach which utilizes spatial congestion information can be effective at determining how to depopulate. ...
doi:10.1109/fpt.2009.5377689
fatcat:l4k4g2yhjjdolnbq3jah35alfe
POLAR 2.0
2014
Proceedings of the The 51st Annual Design Automation Conference on Design Automation Conference - DAC '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To minimize the routing demand, POLAR 2.0 attaches very high importance to maintaining a good wirelength-driven placement in the global placement stage. ...
A wirelength-driven placer without considering routability would lead to unroutable results. ...
NTU-Place4h formulates routing congestion as an additional constraint into its non-linear programming framework. ...
doi:10.1145/2593069.2593181
dblp:conf/dac/LinC14
fatcat:fdrou2z7rreudieunxssiebvc4
Routability-Driven Placement and White Space Allocation
2007
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present a two-stage congestion-driven placement flow. ...
First, during each refinement stage of our multilevel global placement framework, we replace cells based on the wirelength weighted by congestion level to reduce the routing demands of congested regions ...
In an upcoming work, we develop an efficient algorithm for legalization of mixed-size placement [21] and develop a framework of multilevel legalization. ...
doi:10.1109/tcad.2006.884575
fatcat:q7fg3jq6hjaehgsqdrriak4ms4
An integrated nonlinear placement framework with congestion and porosity aware buffer planning
2008
Proceedings of the 45th annual conference on Design automation - DAC '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Therefore, there is essential need for a placement framework with explicit porosity and congestion control. ...
In this paper, we propose the first integrated nonlinear placement framework with porosity and congestion aware buffer planning. ...
The results show that our proposed integrated framework with porosity and congestion aware buffer planning can effectively obtain high quality placement results. ...
doi:10.1145/1391469.1391651
dblp:conf/dac/ChenCP08
fatcat:oraoqufm7zddjb7ato7xoo5n3u
Early Routability Assessment in VLSI Floorplans: A Generalized Routing Model
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
not an effective for early global routability assessment. ...
This starts with placement optimization aimed at improving routability, wirelength, congestion and timing in the design. ...
In order to incorporate this EPE effect in our early global routing framework HGR, we abstract this effect in the routing demand for assessing the congestion scenario in any metal layer at any given routing ...
arXiv:1810.12789v1
fatcat:mtm4tl7aerew5pe64bpu5ws3a4
A SimPLR method for routability-driven placement
2011
2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Additional challenges in routability-driven placement include scalability to large netlists and limiting the complexity of software integration. ...
We also extend global placement to (i) spread cells apart in congested areas, and (ii) move cells together in less-congested areas to ensure short, routable interconnects and moderate runtime. ...
Congestion-driven Placement. ...
doi:10.1109/iccad.2011.6105307
dblp:conf/iccad/KimHLM11
fatcat:tu6sbizo2bev5cp4z76fay7r3m
« Previous
Showing results 1 — 15 out of 8,763 results