String matching on multicontext FPGAs using self-reconfiguration
- 1 February 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 217-226
- https://doi.org/10.1145/296399.296463
Abstract
FPGAs can perform better than ASICs if the logic mapped ontothem is optimized for each problem instance. Unfortunately, thisadvantage is often canceled by the long time needed by CAD toolsto generate problem instance dependent logic and the time requiredto configure the FPGAs.In this paper, a novel approach for runtime mapping is proposedthat utilizes self-reconfigurability of multicontext FPGAs to achievevery high speedups over existing approaches. The key idea is todesign and map...Keywords
This publication has 5 references indexed in Scilit:
- A self-reconfigurable processorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- DPGA-coupled microprocessors: commodity ICs for the early 21st CenturyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A time-multiplexed FPGA architecture for logic emulationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An Embedded DRAM-FPGA Chip With Instantaneous Logic ReconfigurationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- Assessing document relevance with run-time reconfigurable machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1996