Compiling SA-C programs to FPGAs: Performance results

11Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

At the first ICVS, we presented SA-C (“sassy”), a singleassignment variant of the C programming language designed to exploit both coarse-grain and fine-grain parallelism in computer vision and image processing applications. This paper presents a new optimizing compiler that maps SA-C source code onto field programmable gate array (FPGA) configurations. The compiler allows programmers to exploit FPGAs as inexpensive and massively parallel processors by writing high-level source code rather than hardware-level circuit designs. We present several examples of simple image-based programs and the optimizations that are automatically applied to them during compilation, and compare their performance on FPGAs and Pentiums of similar ages. From this, we determine what types of applications benefit from current FPGA technology, and conclude with some speculations on the future development of FPGAs and their expanding role in computer vision systems.

Cite

CITATION STYLE

APA

Draper, B. A., Böhm, A. P. W., Hammes, J., Najjar, W., Ross Beveridge, J., Ross, C., … Bins, J. (2001). Compiling SA-C programs to FPGAs: Performance results. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2095, pp. 220–235). Springer Verlag. https://doi.org/10.1007/3-540-48222-9_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free