DocumentCode :
624337
Title :
Virtual finite-state-machine architectures for fast compilation and portability
Author :
Lu Hao ; Stitt, Greg
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Florida, Gainesville, FL, USA
fYear :
2013
fDate :
5-7 June 2013
Firstpage :
91
Lastpage :
94
Abstract :
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.
Keywords :
computer architecture; field programmable gate arrays; finite state machines; table lookup; FPGA; fast compilation; fast portability; limited portability; lookup-table; vendor tools; virtual architecture; virtual control architectures; virtual finite state machine architectures; Automata; Benchmark testing; Fabrics; Field programmable gate arrays; Random access memory; Table lookup; FPGA; intermediate fabrics; virtual architectures;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Application-Specific Systems, Architectures and Processors (ASAP), 2013 IEEE 24th International Conference on
Conference_Location :
Washington, DC
ISSN :
2160-0511
Print_ISBN :
978-1-4799-0494-5
Type :
conf
DOI :
10.1109/ASAP.2013.6567557
Filename :
6567557
Link To Document :
بازگشت