103 search results - page 1 / 21 » Fast placement approaches for FPGAs |
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
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...
58
Voted
TODAES
2002
14 years 10 months ago
2002
82
Voted
IFIP
1999
Springer
15 years 2 months ago
1999
Springer
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-...
89
Voted
FPGA
2003
ACM
15 years 3 months ago
2003
ACM
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...
DAC
2003
ACM
15 years 3 months ago
2003
ACM
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...