ACM Home Page
Please provide us with feedback. Feedback
C is for circuits: capturing FPGA circuits as sequential code for portability
Full text PdfPdf (366 KB)
Source
International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 16th international ACM/SIGDA symposium on Field programmable gate arrays table of contents
Monterey, California, USA
SESSION: Synthesis at higher-level abstractions table of contents
Pages 117-126  
Year of Publication: 2008
ISBN:978-1-59593-934-0
Authors
Scott Sirowy  University of California: Riverside, Riverside, CA
Greg Stitt  University of Florida, Gainesville, FL
Frank Vahid  University of California: Riverside, Riverside, CA
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 111,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1344671.1344689
What is a DOI?

ABSTRACT

Synthesizing common sequential algorithms, captured in a language like C, to FPGA circuits is now well-known to provide dramatic speedups for numerous applications, and to provide tremendous portability and adaptability advantages over circuit implementations of an application. However, many applications targeted to FPGAs are still designed and distributed at the circuit level, due in part to tremendous human ingenuity being exercised at that level to achieve exceptional performance and efficiency. A question then arises as to whether applications for FPGAs will have to be distributed as circuits to achieve desired performance and efficiency, or if instead a more portable language like C might be used. Given a set of common synthesis transformations, we studied the extent to which circuits published in FCCM in the past 6 years could be captured as sequential code and then synthesized back to the published circuit. The study showed that a surprising 82% of the 35 circuits chosen for the study could be re-derived from some form of standard C code, suggesting that standard C code, without extensions, may be an effective means for distributing FPGA applications


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
 
5
 
6
7
 
8
 
9
 
10
CATAPULTC. http://www.mentor.com/products/c-based_design/
 
11
CELOXICA. http://www.celoxica.com/
 
12
 
13
DINIZ, P., HALL, M., PARK, J., SO, B., AND ZIEGLER, H. 2005. Automatic mapping of C to FPGAs with the DEFACTO compilation and synthesis systems. Journal on Microprocessors and Microsystems, Vol. 29, Issues 2-3, pp. 51--62.
 
14
 
15
 
16
ELES, P., PENG, Z., KUCHCHINSKI, K. AND DOBOLI, A. 1997. System level hardware/software partitioning based on simulated annealing and tabu search. Journal on Design Automation for Embedded Systems, Vol. 2, No. 1, pp. 5--32.
17
18
 
19
 
20
 
21
GUPTA, S., AND G. DEMICHELI 1991. VULCAN -- A System for High-Level Partitioning of Synchronous Digital Circuits. Technical Report.
 
22
 
23
 
24
 
25
 
26
 
27
INTEL QUICKASSIST TECHNOLOGY http://www.intel.com/technology/magazine/45nm/quickassist-0507.htm
28
 
29
30
 
31
 
32
Impulse CoDeveloper. http://www.impulsec.com/
 
33
 
34
 
35
 
36
 
37
 
38
 
39
 
40
 
41
 
42
 
43
SGI ALTIX. http://www.sgi.com/products/servers/altix/
 
44
 
45
 
46
47
48
 
49
 
50
 
51
 
52
 
53
 
54
 
55
 
56
 
57
 
58


Collaborative Colleagues:
Scott Sirowy: colleagues
Greg Stitt: colleagues
Frank Vahid: colleagues