Assessing document relevance with run-time reconfigurable machines

Bernard Gunther, George Milne, Lakshmi Narasimhan

Research output: Contribution to journalConference articlepeer-review

19 Citations (Scopus)


Free-text database searching is a natural candidate for acceleration by run-time reconfigurable custom computing machines. We describe a fully pipelined search machine architecture for scoring the relevance of textual documents against approximately 100 relevant target words, with provision for limited regular expression matching and error tolerance. An implementation on the SPACE custom computing platform indicates that throughput in the order of 20 megabytes per second is achievable on Algotronix FPGAs if a locally synchronous design style is adopted and global communications minimized. Partial reconfiguration of the datapath at run-time, in around 3 seconds, serves to maximize the density of data storage on the machine and correspondingly avoid costly input from the environment.

Original languageEnglish
Pages (from-to)10-17
Number of pages8
JournalIEEE Symposium on FPGAs for Custom Computing Machines, Proceedings
Publication statusPublished - 1 Dec 1996
Externally publishedYes
Event1996 IEEE Symposium on FPGAs for Custom Computing Machines - Napa Valley, United States
Duration: 17 Apr 199619 Apr 1996


Dive into the research topics of 'Assessing document relevance with run-time reconfigurable machines'. Together they form a unique fingerprint.

Cite this