Sciweavers

7 search results - page 1 / 2
» Fast Module Mapping and Placement for Datapaths in FPGAs
Sort
View
FPGA
1998
ACM
128views FPGA» more  FPGA 1998»
13 years 8 months ago
Fast Module Mapping and Placement for Datapaths in FPGAs
Timothy J. Callahan, Philip Chong, André De...
IPPS
2003
IEEE
13 years 10 months 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
MAM
2006
95views more  MAM 2006»
13 years 4 months ago
Stochastic spatial routing for reconfigurable networks
FPGA placement and routing is time consuming, often serving as the major obstacle inhibiting a fast edit-compile-test loop in prototyping and development and the major obstacle pr...
André DeHon, Randy Huang, John Wawrzynek
ICCAD
2008
IEEE
138views Hardware» more  ICCAD 2008»
14 years 1 months ago
Fault tolerant placement and defect reconfiguration for nano-FPGAs
—When manufacturing nano-devices, defects are a certainty and reliability becomes a critical issue. Until now, the most pervasive methods used to address reliability, involve inj...
Amit Agarwal, Jason Cong, Brian Tagiku
FPL
2004
Springer
95views Hardware» more  FPL 2004»
13 years 10 months ago
Increasing Pipelined IP Core Utilization in Process Networks Using Exploration
At Leiden Embedded Research Center, we are building a tool chain called Compaan/Laura that allows us to do fast mapping of applications written in Matlab onto reconfigurable platf...
Claudiu Zissulescu, Bart Kienhuis, Ed F. Depretter...