Mapping complex algorithm into FPGA with High Level Synthesis reconfigurable chips with High Level Synthesis compared with CPU, GPGPU

This presentation discusses on the comparison between "Reconfigurable Chip with High Level Synthesis" and "CPU, GPCPU with compiler such as CUDA" from the compiler perspective. Initially, we introduce several demands for acceleration with FPGA to achieve low latency calculation and control. As an application example, we show a High Frequency Trading. We accelerate it by FPGA NIC with C-based and SQL-based HLS, and show the necessity of high level language customizable reconfigurable chip. Then, we illustrate the difference of FPGA and processor (CPU, GPGPU) with the "FSM+Datapath" model and examine how the architecture difference affects delay and parallelism of operations. Next, we discuss parallelization of operations, threads with High Level Synthesis for FPGA and software compiler for processors. The main advantage of the former method is it is able to parallelize operations beyond control dependencies while the latter method has to obey control dependencies. Finally, some experimental results prove that "FPGA and HLS" generate better performance than a processor for control intensive algorithm.

[1]  Li Jing,et al.  High-Level Synthesis Challenges and Solutions for a Dynamically Reconfigurable Processor , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.

[2]  Takashi Takenaka,et al.  A scalable complex event processing framework for combination of SQL-based continuous queries and C/C++ functions , 2012, 22nd International Conference on Field Programmable Logic and Applications (FPL).

[3]  Kazutoshi Wakabayashi Unified Representation for Speculative Scheduling: Generalized Condition Vector , 2006, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[4]  Takashi Takenaka,et al.  C-Based Complex Event Processing on Reconfigurable Hardware , 2013, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.