Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition
DOI: 10.1109/date.2002.998370
|View full text |Cite
|
Sign up to set email alerts
|

Congestion-aware logic synthesis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(15 citation statements)
references
References 12 publications
0
15
0
Order By: Relevance
“…Assigning the congestion cost to the nets in the congested bins accounts for this discrete nature of routability and also allows the mapper to select area-optimal matches in the sparsely congested regions. Both of these purposes are critical and are served by our algorithm, while previous approaches [8], [9] have not addressed these.…”
Section: Algorithm For Congestion-aware Area-oriented Mappingmentioning
confidence: 95%
See 2 more Smart Citations
“…Assigning the congestion cost to the nets in the congested bins accounts for this discrete nature of routability and also allows the mapper to select area-optimal matches in the sparsely congested regions. Both of these purposes are critical and are served by our algorithm, while previous approaches [8], [9] have not addressed these.…”
Section: Algorithm For Congestion-aware Area-oriented Mappingmentioning
confidence: 95%
“…This approach may result in long wires in the final netlist, and more importantly, may leave a significant portion of the design space unexplored. Pandini et al proposed wirelength as a metric to be minimized during technology mapping in order to reduce the congestion [9]. Although large wirelength may be correlated with high congestion, the correlation is rather poor, and therefore, the mapping based on such a metric may not result in an effective optimization.…”
Section: B Previous Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In case of Figure 4, wires w1 and w2 will have different congestion costs even though the shortest routes in both the cases may have the same length; the congestion cost of w1 will be zero and the congestion cost of w2 will have a positive value as its bounding box contains congested bins. The following equation captures this causality relation between routability and congestion while computing the congestion cost of a net, Ó×Ø Ò Ø , Ó×Ø Ò Ø ¦ Ò¾ ÓÙÒ Ò ÓÜ´Ò Øµ ´ Òµ Ñ Ü Ò Ò Ø (3) where ´ Òµ is the congestion in a bin, Ñ Ü is the threshold …”
Section: Congestion Cost Computationmentioning
confidence: 99%
“…This approach may result in long wires in the final netlist, and more importantly, may be so limiting as to leave a significant portion of the design space unexplored. Pandini et al proposed wirelength as a metric to be minimized during technology mapping in order to reduce the congestion [3]. Although large wirelength may be correlated with high congestion, the correlation is rather poor, and therefore, this may not result in an effective optimization.…”
Section: Introductionmentioning
confidence: 99%