Data Search and Reorganization Using FPGAs: Application to Spatial Pointer-based Data Structures

Authors:
Pedro C. Diniz;Joonseok Park
Affiliations:
-;-
Venue:
FCCM '03 Proceedings of the 11th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Year:
2003

Citing 0
Cited 2

On accelerating the neighbours lists generation process using field programmable gate arrays

ISPRA'05 Proceedings of the 4th WSEAS International Conference on Signal Processing, Robotics and Automation
Traversal caches: a first step towards FPGA acceleration of pointer-based data structures

CODES+ISSS '08 Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis

Quantified Score

Hi-index	0.00

Visualization

Abstract

FPGAs have appealing features such as customizable internaland external bandwidth and the ability to exploit vastamounts of fine-grain parallelism. In this paper we explorethe applicability of these features in using FPGAs as smartmemory engines for search and reorganization computationsover spatial pointer-based data structures. The experimentalresults in this paper suggests that reconfigurable logic, whencombined with data reorganization, can lead to dramaticperformance improvements of up to 20x over traditionalcomputer architectures for pointer-based computations,traditionally not viewed as a good match for reconfigurabletechnologies.