Sciweavers

103 search results - page 1 / 21
» Fast placement approaches for FPGAs
Sort
View
IPPS
2003
IEEE
14 years 19 days ago
Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reco...
Herbert Walder, Christoph Steiger, Marco Platzner
TODAES
2002
47views more  TODAES 2002»
13 years 7 months ago
Fast placement approaches for FPGAs
Russell Tessier
IFIP
1999
Springer
13 years 11 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»
14 years 17 days 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
DAC
2003
ACM
14 years 18 days ago
Fast timing-driven partitioning-based placement for island style FPGAs
In this paper we propose a partitioning-based placement algorithm for FPGAs. The method incorporates simple, but effective heuristics that target delay minimization. The placement...
Pongstorn Maidee, Cristinel Ababei, Kia Bazargan