ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Fast and accurate routing demand estimation for efficient routability-driven placement
Full text PdfPdf (999 KB)
Source Design, Automation, and Test in Europe archive
Proceedings of the conference on Design, automation and test in Europe table of contents
Nice, France
SESSION: Placement and floorplanning table of contents
Pages: 1226 - 1231  
Year of Publication: 2007
ISBN:978-3-9810801-2-4
Authors
Peter Spindler  Technische Universitaet Muenchen, Munich, Germany
Frank M. Johannes  Technische Universitaet Muenchen, Munich, Germany
Sponsors
: IEEE Council on Electronic Design Automation (CEDA)
SIGDA: ACM Special Interest Group on Design Automation
: The EDA Consortium
EDAA : European Design and Automation Association
RAS : RAS
: The IEEE Computer Society TTTC
: ECSI
Publisher
EDA Consortium  San Jose, CA, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 37,   Citation Count: 3
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

This paper presents a fast and accurate routing demand estimation called RUDY and its efficient integration in a force-directed quadratic placer to optimize placements for routability.

RUDY is based on a Rectangular Uniform wire DensitY per net and accurately models the routing demand of a circuit as determined by the wire distribution after final routing. Unlike published routing demand estimation, RUDY depends neither on a bin structure nor on a certain routing model to estimate the behavior of a router. Therefore RUDY is independent of the router.

Our fast and robust force-directed quadratic placer is based on a generic demand-and-supply model and is guided by the routing demand estimation RUDY to optimize placements for routability. This yields a placer which simultaneously reduces the routing demand in congested regions and increases the routing supply there. Therefore our placer fully utilizes the potential to optimize the routability. This results in the best published routed wirelength of the IBMv2 benchmark suite until now. In detail, our approach outperforms mPL, ROOSTER, and APlace by 9%, 8%, and 5%, respectively. Compared by the CPU times, which ROOSTER needs to place this benchmark, our routability optimization placer is eight times faster.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Maogang Wang, Xiaojian Yang, and Majid Sarrafzadeh. Congestion minimization during placement. IEEE Transactions on Computer-Aided Design of Circuits and Systems, 19(10):1140--1148, oct 2000.
 
3
Jinan Lou, Shankar Krishnamoorthy, and Henry S. Sheng. Estimating routing congestion using probablistic analysis. IEEE Transactions on Computer-Aided Design of Circuits and Systems, 21(1):32--41, January 2002.
4
5
6
7
8
9
 
10
Xiaojian Yang, Ryan Kastner, and Majid Sarrafzadeh. Congestion estimation during top-down placement. IEEE Transactions on Computer-Aided Design of Circuits and Systems, 21(1):72--80, January 2002.
11
12
13
14
15
16
17
 
18
Xiaojian Yang, Bo-Kyung Choi, and Majid Sarrafzadeh. Routability-driven white space allocation for fixed-die standard-cell placement. IEEE Transactions on Computer-Aided Design of Circuits and Systems, 22(4):410--419, April 2003.
 
19
20
21
 
22
 
23
Qinke Wang Andrew B. Kahng. Implementation and extensibility of an analytic placer. IEEE Transactions on Computer-Aided Design of Circuits and Systems, 24(05):734--747, May 2005.
 
24
Ucla/umich physical design tools. http://vlsicad.eecs.umich.edu/BK/PDtools.
25
26
27
 
28
K. M. Hall. An r-dimensional quadratic placement algorithm. Management Science, 17(3):219--229, November 1970.
 
29
Standard Performance Evaluation Corporation. SPEC CPU 2000. http://www.spec.org/cpu2000.

CITED BY  7
Collaborative Colleagues:
Peter Spindler: colleagues
Frank M. Johannes: colleagues