| Understanding and addressing the impact of wiring congestion during technology mapping |
| Full text |
Pdf
(416 KB)
|
| Source
|
International Symposium on Physical Design
archive
Proceedings of the 2002 international symposium on Physical design
table of contents
San Diego, CA, USA
SESSION: Poster Paper Introductions
table of contents
Pages: 131 - 136
Year of Publication: 2002
ISBN:1-58113-460-6
|
|
Authors
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 5, Downloads (12 Months): 17, Citation Count: 1
|
|
|
ABSTRACT
Traditionally, interconnect effects are taken into account during
logic synthesis via wireload models, but their ineffectiveness for
DSM technologies has been demonstrated and various physical
synthesis approaches have been spawned to address the problem. Of
particular interest is that logic block size is no longer dictated
exclusively by total cell area, yet synthesis optimization
objectives are aimed specifically at minimizing the number and size
of cells. Methodologies that incorporate congestion within the
logic synthesis objective function have been proposed in
[9][10][11] and [15]; however, as we will demonstrate, predicting
the true congestion prior to layout is not possible, and the
efficacy of any approach can only be evaluated after routing is
completed within the fixed die size. In this paper we propose a
practical, complete methodology which first performs
congestion-aware technology mapping using a global weighting factor
for the cost function [15], and then applies incremental localized
unmapping and remapping on congested areas. This complete approach
addresses the problem that one global factor is not ideally suited
for all regions of the designs. Most importantly, through the
application of this methodology to industrial examples we will show
that any attempt at a purely top-down single-pass congestion-aware
technology mapping is merely wishful thinking.
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
|
H. B. Bakoglu. "Circuits, Interconnections and Packaging". Addison Wesley, Reading, MA, 1990.
|
 |
2
|
|
| |
3
|
|
 |
4
|
Padmini Gopalakrishnan , Altan Odabasioglu , Lawrence Pileggi , Salil Raje, Overcoming wireload model uncertainty during physical design, Proceedings of the 2001 international symposium on Physical design, p.182-189, April 01-04, 2001, Sonoma, California, United States
[doi> 10.1145/369691.369769]
|
 |
5
|
|
| |
6
|
E. Detjens, G. Gannot, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang. "Technology Mapping in MIS". In Proc. ACM/IEEE Intl. Conf. on Computer-Aided Design, pages 116--119, Nov. 1987.
|
 |
7
|
|
| |
8
|
A. H. Salek, J. Lou, and M. Pedram. "An Integrated Logical and Physical Design Flow for Deep Submicron Circuits". IEEE Transac¿tions on CAD, vol. 18, no. 9, pages 1305--1315, Sept. 1999.
|
| |
9
|
M. Pedram, and N. Bhat. "Layout Driven Logic Restructuring/Decomposition". In Proc. ACM/IEEE Intl. Conf. on Computer-Aided Design, pages 134--137, Nov. 1991.
|
 |
10
|
|
| |
11
|
|
| |
12
|
G. Meixner, and U. Lauther. "Congestion-Driven Placement Using a New Multi-Partitioning Heuristic". In Proc. ACM/IEEE Intl. Conf. on Comp. Aided Design, pages 332--335, Nov. 1990.
|
 |
13
|
Phiroze N. Parakh , Richard B. Brown , Karem A. Sakallah, Congestion driven quadratic placement, Proceedings of the 35th annual conference on Design automation, p.275-278, June 15-19, 1998, San Francisco, California, United States
[doi> 10.1145/277044.277121]
|
 |
14
|
Lalgudi N. Kannan , Peter R. Suaris , Hong-Gee Fang, A methodology and algorithms for post-placement delay optimization, Proceedings of the 31st annual conference on Design automation, p.327-332, June 06-10, 1994, San Diego, California, United States
[doi> 10.1145/196244.196399]
|
| |
15
|
|
| |
16
|
M. Borgatti, F. Lertora, B. Foiret, and L. Cali'. "A Reconfigurable System featuring Dynamically Extensible Embedded Microprocessor, FPGA and Customisable I/O". In Proc. IEEE CICC, May 2002.
|
|