Virtual finite-state-machine architectures for fast compilation and portability

FPGA productivity suffers from lengthy compilation times and limited portability. To address these issues, previous work introduced virtual architecture overlays that enable application portability across FPGAs and place-androute that is orders-of-magnitude faster than device vendor tools. However, those previous approaches have limited applicability due to a focus on pipelines with few control requirements. In this paper, we expand control capabilities of previous work by introducing virtual control architectures for finite state machines. The presented architectures reduce lookup-table requirements by multiple orders-of-magnitude and enable larger finite state machines used in common benchmarks.

[1]  Valery Sklyarov Reconfigurable models of finite state machines and their implementation in FPGAs , 2002, J. Syst. Archit..

[2]  Valery Sklyarov Hierarchical finite-state machines and their use for digital control , 1999, IEEE Trans. Very Large Scale Integr. Syst..

[3]  Frank Vahid,et al.  A quantitative analysis of the speedup factors of FPGAs over processors , 2004, FPGA '04.

[4]  Nachiket Kapre,et al.  Packet Switched vs. Time Multiplexed FPGA Overlay Networks , 2006, 2006 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines.

[5]  A. Civit-Balcells,et al.  ROM-Based Finite State Machine Implementation in Low Cost FPGAs , 2007, 2007 IEEE International Symposium on Industrial Electronics.

[6]  James Coole,et al.  Intermediate fabrics: Virtual architectures for circuit portability and fast placement and routing , 2010, 2010 IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS).

[7]  Greg Stitt,et al.  A low-overhead interconnect architecture for virtual reconfigurable fabrics , 2012, CASES '12.

[8]  Guy Lemieux,et al.  ZUMA: An Open FPGA Overlay Architecture , 2012, 2012 IEEE 20th International Symposium on Field-Programmable Custom Computing Machines.