Skip to main content

Quantitative Analysis of Run-Time Reconfigurable Database Search

  • Conference paper
Field Programmable Logic and Applications (FPL 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1673))

Included in the following conference series:

  • 835 Accesses

Abstract

This paper reports two contributions to the theory and practice of reconfigurable search engines based on hashing techniques. The first contribution concerns technology-independent optimisations involving run-time reconfiguration of hash functions; a quantitative framework is developed for estimating design trade-offs, such as the amount of temporary storage versus reconfiguration time. The second contribution concerns methods for optimising implementations in Xilinx FPGA technology, which achieve different trade-offs in cell utilisation, reconfiguration time and critical path delay; quantitative analysis of these trade-offs is provided.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Buell, D., Arnold, J., Kleinfelder, W.: Splash 2, FPGAs in a Custom Computing Machine. IEEE Computer Society Press, Los Alamitos (1996)

    Google Scholar 

  2. Lemoine, E., Merceron, D.: Run time reconfiguration of FPGAs for scanning genomic databases. In: Proc. FCCM 1995, pp. 90–98. IEEE Computer Society Press, Los Alamitos (1995)

    Google Scholar 

  3. Luk, W., Shirazi, N., Guo, S.R., Cheung, P.Y.K.: Pipeline morphing and virtual pipelines. In: Glesner, M., Luk, W. (eds.) FPL 1997. LNCS, vol. 1304, pp. 111–120. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  4. Mosanya, E., Sanchez, E.: A FPGA-based hardware implementation of generalized profile search using online arithmetic. In: Proc. ACM Int. Symp. on FPGAs, pp. 101–111. ACM Press, New York (1999)

    Google Scholar 

  5. Shirazi, N., Luk, W., Cheung, P.Y.K.: Run-time management of dynamically reconfigurable designs. In: Hartenstein, R.W., Keevallik, A. (eds.) FPL 1998. LNCS, vol. 1482, pp. 59–68. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  6. Wirthlin, M.J., Hutchings, B.L.: Improving functional density through runtime constant propagation. In: Proc. ACM Int. Symp. on FPGAs, pp. 86–92. ACM Press, New York (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shirazi, N., Luk, W., Benyamin, D., Cheung, P.Y.K. (1999). Quantitative Analysis of Run-Time Reconfigurable Database Search. In: Lysaght, P., Irvine, J., Hartenstein, R. (eds) Field Programmable Logic and Applications. FPL 1999. Lecture Notes in Computer Science, vol 1673. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48302-1_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-48302-1_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66457-4

  • Online ISBN: 978-3-540-48302-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics