Sciweavers

36 search results - page 5 / 8
» A Congestion Driven Placement Algorithm for FPGA Synthesis
Sort
View
ICCAD
1995
IEEE
106views Hardware» more  ICCAD 1995»
14 years 3 days ago
Re-engineering of timing constrained placements for regular architectures
In a typical design ow, the design may be altered slightly several times after the initial design cycle according to minor changes in the design speci cation either as a result o...
Anmol Mathur, K. C. Chen, C. L. Liu
DAC
2004
ACM
14 years 9 days ago
Quadratic placement using an improved timing model
The performance of timing-driven placement methods depends strongly on the choice of the net model. In this paper a more precise net model is presented that does not increase nume...
Bernd Obermeier, Frank M. Johannes
FPGA
2004
ACM
126views FPGA» more  FPGA 2004»
14 years 1 months ago
A synthesis oriented omniscient manual editor
The cost functions used to evaluate logic synthesis transformations for FPGAs are far removed from the final speed and routability determined after placement, routing and timing a...
Tomasz S. Czajkowski, Jonathan Rose
ISQED
2007
IEEE
97views Hardware» more  ISQED 2007»
14 years 2 months ago
Probabilistic Congestion Prediction with Partial Blockages
— Fast and accurate routing congestion estimation is essential for optimizations such as floorplanning, placement, buffering, and physical synthesis that need to avoid routing c...
Zhuo Li, Charles J. Alpert, Stephen T. Quay, Sachi...
ICCAD
2004
IEEE
260views Hardware» more  ICCAD 2004»
14 years 5 months ago
On interactions between routing and detailed placement
The main goal of this paper is to develop deeper insights into viable placement-level optimization of routing. Two primary contributions are made. First, an experimental framework...
Devang Jariwala, John Lillis