Sciweavers

16 search results - page 1 / 4
» Fast FPGA Placement using Space-filling Curve
Sort
View
TVCG
2008
109views more  TVCG 2008»
13 years 4 months ago
Rapid Graph Layout Using Space Filling Curves
Abstract-- Network data frequently arises in a wide variety of fields, and node-link diagrams are a very natural and intuitive representation of such data. In order for a node-link...
Chris Muelder, Kwan-Liu Ma
FPL
2005
Springer
127views Hardware» more  FPL 2005»
13 years 10 months ago
Fast FPGA Placement using Space-filling Curve
In this paper, we propose a placement method for islandstyle FPGAs, based on recursive bi-partitioning followed by application of space-filling curves. Experimental results of ou...
Pritha Banerjee, Subhasis Bhattacharjee, Susmita S...
IFIP
1999
Springer
13 years 9 months ago
Frontier: A Fast Placement System for FPGAs
In this paper we describe Frontier, an FPGA placement system that uses design macro-blocks in conjuction with a series of placement algorithms to achieve highly-routable and high-...
Russell Tessier
FPGA
2003
ACM
116views FPGA» more  FPGA 2003»
13 years 10 months ago
Hardware-assisted simulated annealing with application for fast FPGA placement
To truly exploit FPGAs for rapid turn-around development and prototyping, placement times must be reduced to seconds; latebound, reconfigurable computing applications may demand p...
Michael G. Wrighton, André DeHon
FPGA
1999
ACM
139views FPGA» more  FPGA 1999»
13 years 9 months ago
Trading Quality for Compile Time: Ultra-Fast Placement for FPGAs
The demand for high-speed FPGA compilation tools has occurred for three reasons: first, as FPGA device capacity has grown, the computation time devoted to placement and routing h...
Yaska Sankar, Jonathan Rose