The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - July/August (2011 vol.28)
pp: 38-47
Joonseok Park , Inha University
Pedro C. Diniz , University of Southern California
ABSTRACT
<p><it>Editor's note:</it></p><p>The significant acceleration of code containing pointer-based data structures is beyond the reach of most high-level synthesis tools, yet a large amount of legacy scientific computing code contains these structures. This article presents a method to cope with such code within a reconfigurable computing context.</p><p align="right"><it>&#x2014;George A. Constantinides (Imperial College London) and Nicola Nicolici (McMaster University)</it></p>
INDEX TERMS
design and test, reconfigurable hardware, FPGAs, data reorganization, memory controls
CITATION
Joonseok Park, Pedro C. Diniz, "Data Reorganization and Prefetching of Pointer-Based Data Structures", IEEE Design & Test of Computers, vol.28, no. 4, pp. 38-47, July/August 2011, doi:10.1109/MDT.2011.45
REFERENCES
1. P. Diniz and J. Park, "Data Reorganization Engines for the Next Generation of FPGAs," Proc. ACM/SIGDA Symp. Field-Programmable Gate Arrays (FPGA 02), ACM Press, 2002, pp. 100-110.
2. J. Smith and S. Chang, "Quad-Tree Segmentation for Texture-Based Image Query," Proc. ACM Conf. Multimedia (MM 94), ACM Press, 1994, pp. 279-286.
41 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool