Automatic synthesis of parallel programs targeted to dynamically reconfigurable logic arrays

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

Abstract

Dynamically reconfigurable Field Programmable Gate Arrays (FPGAs) offer virtually unlimited numbers of gates to an application. This technology makes feasible large applications which can be temporally partitioned, with each phase being rapidly loaded onto the chip as required. We demonstrate in this paper an automatic technique to temporally partition a parallel program. Our technique partitions along a data parallel C program’s function scopes. A configuration bit stream is generated for each function, and the host control program is generated which automatically loads the function’s configuration file as the function is entered during execution. Preliminary results show that this partitioning makes it possible to - run larger problem sets, - run programs which would not otherwise fit on the chip, and - include program-specific debug code without performance penalty. Our compiler targets the NAPA accelerator board, a PCI bus based parallel system whose processors consist of Multi Chip Modules composed of National Semiconductor CLAy™ FPGAs.

Cite

CITATION STYLE

APA

Gokhale, M., & Marks, A. (1995). Automatic synthesis of parallel programs targeted to dynamically reconfigurable logic arrays. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 975, pp. 399–408). Springer Verlag. https://doi.org/10.1007/3-540-60294-1_134

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