Throughput analysis for a high-performance FPGA-accelerated real-time search application

Authors:
Wim Vanderbauwhede;S. R. Chalamalasetti;M. Margala
Affiliations:
School of Computing Science, University of Glasgow, Glasgow, UK;Department of Electrical and Computer Engineering, University of Massachusetts Lowell, Lowell, MA;Department of Electrical and Computer Engineering, University of Massachusetts Lowell, Lowell, MA
Venue:
International Journal of Reconfigurable Computing - Special issue on High-Performance Reconfigurable Computing
Year:
2012

Citing 5
Cited 1

Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Relevance based language models

Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Term dependence: a basis for Luhn and Zipf models

Journal of the American Society for Information Science and Technology
Developing energy efficient filtering systems

Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
High-Performance Computing with Accelerators

Computing in Science and Engineering

High throughput filtering using FPGA-acceleration

Proceedings of the 22nd ACM international conference on Conference on information & knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an FPGA design for the relevancy computation part of a high-throughput real-time search application. The application matches terms in a stream of documents against a static profile, held in off-chip memory. We present a mathematical analysis of the throughput of the application and apply it to the problem of scaling the Bloom filter used to discard nonmatches.