Proceedings of ISCAS'95 - International Symposium on Circuits and Systems
DOI: 10.1109/iscas.1995.521529
|View full text |Cite
|
Sign up to set email alerts
|

SPEED: fast and efficient timing driven placement

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
43
0

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 66 publications
(43 citation statements)
references
References 16 publications
0
43
0
Order By: Relevance
“…We use three net delay models. The star model from [25] applies Elmore formulas to a star topology with the star point placed at the center of gravity of all pins. Other models use the D2M formulas from [2], and we apply them to Rectilinear Steiner Minimal Trees (RSMTs) generated by the FLUTE package [10] 2 or to actual net routes produced by an industry router.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…We use three net delay models. The star model from [25] applies Elmore formulas to a star topology with the star point placed at the center of gravity of all pins. Other models use the D2M formulas from [2], and we apply them to Rectilinear Steiner Minimal Trees (RSMTs) generated by the FLUTE package [10] 2 or to actual net routes produced by an industry router.…”
Section: Resultsmentioning
confidence: 99%
“…Effects of delay model on physical safeness: in order to explore other factors that may affect the stability of physical synthesis techniques, we reran the same experiments using the STA engine based on the star model [25] to study the relation between STA accuracy and physical Table 8, which should be compared with Table 6 where timing analysis based on RSMT topology is used. These results show that the star model often overestimates delay, and therefore may also overestimate delay improvement.…”
Section: Evaluation Of Saferesynth: From the Results Shown Inmentioning
confidence: 99%
“…Analytic placers, such as quadratic placement [5] [6], are commonly used in commercial FPGA CAD flows to provide an initial high-level placement. They generally complete in less time than other heuristics but do not guarantee a legal placement as the final placement might have overlapping logic blocks [5]. Instead, they are generally used to provide an initial placement for larger designs that is fine tuned using heuristic algorithms (e.g.…”
Section: Introductionmentioning
confidence: 99%
“…However, placement algorithms are usually not well suited to honor these bounds. Another popular net-based placement approach is to assign higher net weights to the more timing critical nets [7] [5] [6] [8] [9] [10]. The net weights may be iteratively updated for multiple placement runs [7] [9] [11] [12].…”
Section: Introductionmentioning
confidence: 99%
“…Another popular net-based placement approach is to assign higher net weights to the more timing critical nets [7] [5] [6] [8] [9] [10]. The net weights may be iteratively updated for multiple placement runs [7] [9] [11] [12]. However, in a modern ASIC physical synthesis flow that needs to deal with millions of placeable cells, global placement is usually performed only two or three times for acceptable turn around time.…”
Section: Introductionmentioning
confidence: 99%