Sciweavers

36 search results - page 5 / 8
» Runtime and quality tradeoffs in FPGA placement and routing
Sort
View
FPL
2010
Springer
124views Hardware» more  FPL 2010»
14 years 7 months ago
Finding System-Level Information and Analyzing Its Correlation to FPGA Placement
One of the more popular placement algorithms for Field Programmable Gate Arrays (FPGAs) is called Simulated Annealing (SA). This algorithm tries to create a good quality placement ...
Farnaz Gharibian, Lesley Shannon, Peter Jamieson
ICCAD
2006
IEEE
119views Hardware» more  ICCAD 2006»
15 years 6 months ago
FastRoute: a step to integrate global routing into placement
Because of the increasing dominance of interconnect issues in advanced IC technology, placement has become a critical step in the IC design flow. To get accurate interconnect inf...
Min Pan, Chris C. N. Chu
ISPD
2010
ACM
224views Hardware» more  ISPD 2010»
15 years 4 months ago
An analytical placer for mixed-size 3D placement
Existing 3D placement techniques are mainly used for standardcell circuits, while mixed-size placement is needed to support highlevel functional units and intellectual property (I...
Jason Cong, Guojie Luo
ICCAD
2009
IEEE
109views Hardware» more  ICCAD 2009»
14 years 7 months ago
CRISP: Congestion reduction by iterated spreading during placement
Dramatic progress has been made in algorithms for placement and routing over the last 5 years, with improvements in both speed and quality. Combining placement and routing into a ...
Jarrod A. Roy, Natarajan Viswanathan, Gi-Joon Nam,...
VLSID
2005
IEEE
128views VLSI» more  VLSID 2005»
15 years 9 months ago
On-Line Synthesis for Partially Reconfigurable FPGAs
An important application of dynamically and partially reconfigurable computing platforms is in dynamic task allocation and execution. On-line synthesis, on-line placement and on-l...
Renqiu Huang, Ranga Vemuri