String matching on multicontext FPGAs using self-reconfiguration

Abstract

An approach for runtime mapping is proposed that utilizes self-reconfigurability of multicontext field programmable gate arrays (FPGA) to achieve very high speedups over existing approaches. The idea is to design and map logic onto a multicontext FPGA that in turn maps problem instance dependent logic onto other contexts of the same FPGA. As a result, computer aided design tools need to be used just once for each problem and not once for every problem instance as is usually done.