DocumentCode
3344711
Title
Automatic On-chip Memory Minimization for Data Reuse
Author
Liu, Qiang ; Constantinides, George A. ; Masselos, Konstantinos ; Cheung, Peter Y K
Author_Institution
Imperial Coll., London
fYear
2007
fDate
23-25 April 2007
Firstpage
251
Lastpage
260
Abstract
FPGA-based computing engines have become a promising option for the implementation of computationally intensive applications due to high flexibility and parallelism. However, one of the main obstacles to overcome when trying to accelerate an application on an FPGA is the bottleneck in off-chip communication, typically to large memories. Often it is known at compile-time that the same data item is accessed many times, and as a result can be loaded once from large off-chip RAM onto scarce on-chip RAM, alleviating this bottleneck. This paper addresses how to automatically derive an address mapping that reduces the size of the required on-chip memory for a given memory access pattern. Experimental results demonstrate that, in practice, our approach reduces on-chip storage requirements to the minimum, corresponding to a reduction in on-chip memory size of up to 40times (average 10times) for some benchmarks compared to a naive approach. At the same time, no clock period penalty or increase in control logic area compared to this approach is observed for these benchmarks.
Keywords
field programmable gate arrays; random-access storage; FPGA-based computing engines; automatic on-chip memory minimization; data reuse; memory access pattern; off-chip RAM; off-chip communication; on-chip RAM; Acceleration; Clocks; Computer applications; Concurrent computing; Engines; Field programmable gate arrays; Logic; Parallel processing; Random access memory; Read-write memory;
fLanguage
English
Publisher
ieee
Conference_Titel
Field-Programmable Custom Computing Machines, 2007. FCCM 2007. 15th Annual IEEE Symposium on
Conference_Location
Napa, CA
Print_ISBN
978-0-7695-2940-0
Type
conf
DOI
10.1109/FCCM.2007.18
Filename
4297261
Link To Document