Publications

Detailed Information

In-memory database acceleration on FPGAs: a survey

Cited 38 time in Web of Science Cited 53 time in Scopus
Authors

Fang, Jian; Mulder, Yvo T. B.; Hidders, Jan; Lee, Jinho; Hofstee, H. Peter

Issue Date
2020-01
Publisher
SPRINGER
Citation
VLDB JOURNAL, Vol.29 No.1, pp.33-59
Abstract
While FPGAs have seen prior use in database systems, in recent years interest in using FPGA to accelerate databases has declined in both industry and academia for the following three reasons. First, specifically for in-memory databases, FPGAs integrated with conventional I/O provide insufficient bandwidth, limiting performance. Second, GPUs, which can also provide high throughput, and are easier to program, have emerged as a strong accelerator alternative. Third, programming FPGAs required developers to have full-stack skills, from high-level algorithm design to low-level circuit implementations. The good news is that these challenges are being addressed. New interface technologies connect FPGAs into the system at main-memory bandwidth and the latest FPGAs provide local memory competitive in capacity and bandwidth with GPUs. Ease of programming is improving through support of shared coherent virtual memory between the host and the accelerator, support for higher-level languages, and domain-specific tools to generate FPGA designs automatically. Therefore, this paper surveys using FPGAs to accelerate in-memory database systems targeting designs that can operate at the speed of main memory.
ISSN
1066-8888
URI
https://hdl.handle.net/10371/200506
DOI
https://doi.org/10.1007/s00778-019-00581-w
Files in This Item:
There are no files associated with this item.
Appears in Collections:

Related Researcher

  • College of Engineering
  • Department of Electrical and Computer Engineering
Research Area AI Accelerators, Distributed Deep Learning, Neural Architecture Search

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share