Skip to main content
SpringerLink
Log in

Hardware Accelerators for Data Search

  • Chapter
  • First Online:
FPGA-BASED Hardware Accelerators

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 566))

  • 1670 Accesses

Abstract

This chapter is dedicated to searching networks, which permit to find extreme values in a set of data and to check if there are items satisfying some predefined conditions or limitations, indicated by given thresholds. The simplest task is retrieving the maximum and/or the minimum values. More complicated procedures permit the most frequent value/item to be found and a set of the most frequent values/items above a given threshold or satisfying some other constraint to be retrieved. The described above tasks may be solved for entire data sets, for intervals of data sets, or for specially organized structures, such as Boolean/ternary matrices. Different architectures are proposed that rely on: combinational and iterative searching networks, address-based technique, and some others. They are modelled in software (using Java language) and implemented in FPGA on the basis of the design technique described in the previous chapter. All necessary details for software and the basic VHDL modules for FPGA are presented and discussed. Searching maximum/minimum items in very large data sets and pipelining are also overviewed. The networks of this chapter will be used as components of more complicated systems considered in subsequent chapters.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Cormen TH, Leiserson CE, Rivest RL, Stain C (2009) Introduction to algorithms, 3rd edn. MIT Press, Cambridge

    Google Scholar 

  2. Chee CH, Jaafar J, Aziz IA, Hasan MH, Yeoh W (2018) Algorithms for frequent itemset mining: a literature review. Artif Intell Rev

    Google Scholar 

  3. Yamamoto K, Ikebe M, Asai T, Motomura M (2016) FPGA-based stream processing for frequent itemset mining with incremental multiple hashes. Circuits Syst 7(10):3299–3309

    Article  Google Scholar 

  4. Teubner J, Muller R, Alonso G (2011) Frequent item computation on a chip. IEEE Trans Knowl Data Eng 23(8):1169–1181

    Article  Google Scholar 

  5. Sun Y, Wang Z, Huang S, Wang L, Wang Y, Luo R, Yang H (2014) Accelerating frequent item counting with FPGA. In: Proceedings of the 2014 ACM/SIGDA international symposium on Field-Programmable Gate Arrays—FPGA’14, Monterey, CA, USA, Feb 2014, pp 109–112

    Google Scholar 

  6. Yin Z, Chang C, Zhang Y (2010) An information hiding scheme based on (7,4) Hamming code oriented wet paper codes. Int J Innov Comput Inf Control 6(7):3121–4198

    Google Scholar 

  7. Lin RD, Chen TH, Huang CC, Lee WB, Chen WSE (2009) A secure image authentication scheme with tampering proof and remedy based on Hamming code. Int J Innov Comput Inf Control 5(9):2603–2618

    Google Scholar 

  8. Sklyarov V, Skliarova I (2013) Digital Hamming weight and distance analyzers for binary vectors and matrices. Int J Innov Comput Inf Control 9(12):4825–4849

    Google Scholar 

  9. Vaishampayan VA (2012) Query matrices for retrieving binary vectors based on the Hamming distance oracle. AT&T Labs-Research. Shannon Laboratory. http://arxiv.org/pdf/1202.2794v1.pdf. Accessed 9 Mar 2019

  10. Ma R, Cheng S (2011) The universality of generalized Hamming code for multiple sources. IEEE Trans Commun 59(10):2641–2647

    Article  Google Scholar 

  11. Bailey DG (2011) Design for embedded image processing on FPGAs. Wiley

    Google Scholar 

  12. Sklyarov V, Skliarova I, Mihhailov D, Sudnitson A (2011) Implementation in FPGA of address-based data sorting. In: Proceedings of the 21st international conference on field programmable logic and applications, Crete, Greece, 2011, pp 405–410

    Google Scholar 

  13. Reingold EM, Nievergelt J, Deo N (1977) Combinatorial algorithms. Theory and practice. Prentice-Hall, Englewood Cliffs NJ

    MATH  Google Scholar 

  14. Zakrevskij A, Pottoson Y, Cheremisiniva L (2008) Combinatorial algorithms of discrete mathematics. TUT Press

    Google Scholar 

  15. Zakrevskii A (1981) Logical synthesis of cascade networks. Nauka

    Google Scholar 

  16. Skliarova I, Ferrari AB (2004) A software/reconfigurable hardware SAT solver. IEEE Trans Very Large Scale Integr (VLSI) Syst 12(4):408–419

    Article  Google Scholar 

  17. Skliarova I, Ferrari AB (2004) Reconfigurable hardware SAT solvers: a survey of systems. IEEE Trans Comput 53(11):1449–1461

    Article  Google Scholar 

  18. Skliarova I, Ferrari AB (2003) The design and implementation of a reconfigurable processor for problems of combinatorial computation. J Syst Architect 49(4–6):211–226

    Article  Google Scholar 

  19. Sklyarov V, Skliarova I (2013) Parallel processing in FPGA-based digital circuits and systems. TUT Press

    Google Scholar 

  20. Sklyarov V, Skliarova I, Barkalov A, Titarenko L (2014) Synthesis and optimization of FPGA-based systems. Springer, Berlin

    Book  Google Scholar 

  21. Sklyarov V, Skliarova I (2013) Fast regular circuits for network-based parallel data processing. Adv Electr Comput Eng 13(4):47–50

    Article  Google Scholar 

  22. Sklyarov V, Skliarova I, Utepbergenov I, Akhmediyarova A (2019) Hardware accelerators for information processing in high-performance computing systems. Int J Innov Comput Inf Control 15(1):321–335

    Google Scholar 

  23. Wang C (ed) (2018) High performance computing for big data. Methodologies and applications. CLR Press by Taylor & Francis Group, London

    Google Scholar 

  24. Rouhani BD, Mirhoseini A, Songhori EM, Koushanfar F (2016) Automated real-time analysis of streaming big and dense data on reconfigurable platforms. ACM Trans Reconfig Technol Syst 10(1)

    Article  Google Scholar 

  25. Gao Y, Huang S, Parameswaran A (2018) Navigating the data lake with datamaran: automatically extracting structure from log datasets. In: Proceedings of the 2018 international conference on management of data—SIGMOD’18, Houston, TX, USA

    Google Scholar 

  26. Chen CLP, Zhang CY (2014) Data-intensive applications, challenges, techniques and technologies: a survey on big data. Inf Sci 275:314–347

    Article  Google Scholar 

  27. Parhami B (2018) Computer architecture for big data. In: Sakr S, Zomaya A (eds) Encyclopedia of big data technologies. Springer, Berlin

    Google Scholar 

  28. Chrysos G, Dagritzikos P, Papaefstathiou I, Dollas A (2013) HC-CART: A parallel system implementation of data mining classification and regression tree (CART) algorithm on a multi-FPGA system. ACM Trans Archit Code Optim 9(4):47:1–47:25

    Article  Google Scholar 

  29. Baker ZK, Prasanna VK (2006) An architecture for efficient hardware data mining using reconfigurable computing systems. In: Proceedings of the 14th annual IEEE symposium on field-programmable custom computing machines—FCCM’06, Napa, USA, April 2006, pp. 67–75

    Google Scholar 

  30. Sun S (2011) Analysis and acceleration of data mining algorithms on high performance reconfigurable computing platforms. Ph.D. thesis. Iowa State University. http://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1421&context=etd. Accessed 9 Mar 2019

  31. Wu X, Kumar V, Quinlan JR et al (2007) Top 10 algorithms in data mining. Knowl Inf Syst 14(1):1–37

    Article  Google Scholar 

  32. Firdhous MFM (2010) Automating legal research through data mining. Int J Adv Comput Sci Appl 1(6):9–16

    Google Scholar 

  33. Zmaranda D, Silaghi H, Gabor G, Vancea C (2013) Issues on applying knowledge-based techniques in real-time control systems. Int J Comput Commun Control 8(1):166–175

    Article  Google Scholar 

  34. Field L, Barnie T, Blundy J, Brooker RA, Keir D, Lewi E, Saunders K (2012) Integrated field, satellite and petrological observations of the November 2010 eruption of Erta Ale. Bull Volc 74(10):2251–2271

    Article  Google Scholar 

  35. Zhang W, Thurow K, Stoll R (2014) A knowledge-based telemonitoring platform for application in remote healthcare. Int J Comput Commun Control 9(5):644–654

    Article  Google Scholar 

  36. Verber D (2011) Hardware implementation of an earliest deadline first task scheduling algorithm. Informacije MIDEM 41(4):257–263

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronics Telecommunications and Informatics, University of Aveiro, Aveiro, Portugal

    Iouliia Skliarova

  2. Department of Electronics Telecommunications and Informatics, University of Aveiro, Aveiro, Portugal

    Valery Sklyarov

Authors
  1. Iouliia Skliarova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Valery Sklyarov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Iouliia Skliarova .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Skliarova, I., Sklyarov, V. (2019). Hardware Accelerators for Data Search. In: FPGA-BASED Hardware Accelerators. Lecture Notes in Electrical Engineering, vol 566. Springer, Cham. https://doi.org/10.1007/978-3-030-20721-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-20721-2_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-20720-5

  • Online ISBN: 978-3-030-20721-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation