Sciweavers

FCCM
2003
IEEE

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

14 years 5 months ago
Data Search and Reorganization Using FPGAs: Application to Spatial Pointer-based Data Structures
FPGAs have appealing features such as customizable internal and external bandwidth and the ability to exploit vast amounts of fine-grain parallelism. In this paper we explore the applicability of these features in using FPGAs as smart memory engines for search and reorganization computations over spatial pointer-based data structures. The experimental results in this paper suggests that reconfigurable logic, when combined with data reorganization, can lead to dramatic performance improvements of up to 20x over traditional computer architectures for pointer-based computations, traditionally not viewed as a good match for reconfigurable technologies. Keywords Custom Computing; Data search and Data Reorganization Engines; Hardware support for Pointer Operations; FieldProgrammable-Gate-Arrays (FPGAs).
Pedro C. Diniz, Joonseok Park
Added 04 Jul 2010
Updated 04 Jul 2010
Type Conference
Year 2003
Where FCCM
Authors Pedro C. Diniz, Joonseok Park
Comments (0)