Name
Abstract | ||
|---|---|---|
Today’s computing systems use a huge amount of energy and time to process basic queries in database. A large part of it is spent in data movement between the memory and processing cores, owing to the limited cache capacity and memory bandwidth of traditional computers. In this paper, we propose a nonvolatile memory-based query accelerator, called NVQuery, which performs several basic query functions in memory including aggregation, prediction, bit-wise operations, join operations, as well as exact and nearest distance search queries. NVQuery is implemented on a content addressable memory and exploits the analog characteristic of nonvolatile memory in order to enable in-memory processing. To implement nearest distance search in memory, we introduce a novel bitline driving scheme to give weights to the indices of the bits during the search operation. To further improve the energy efficiency, our design supports configurable approximation by adaptively putting memory blocks under voltage overscaling. Our experimental evaluation shows that a NVQuery can provide
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$49.3{\boldsymbol \times }$ </tex-math></inline-formula>
performance speedup and
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$32.9{\boldsymbol \times }$ </tex-math></inline-formula>
energy savings as compared to running the same query on traditional processor. Approximation improves the energy-delay product (EDP) of NVQuery by
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$7.3{\boldsymbol \times }$ </tex-math></inline-formula>
, while providing acceptable accuracy. In addition, NVQuery can achieve
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$30.1{\boldsymbol \times }$ </tex-math></inline-formula>
EDP improvement as compared to the state-of-the-art query accelerators. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/tcad.2018.2819080 | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems |
Keywords | Field | DocType |
Nonvolatile memory,Random access memory,Query processing,Table lookup,Memory management,Optimization,Bandwidth | Memory bandwidth,Content-addressable memory,Efficient energy use,Computer science,Parallel computing,Exploit,Real-time computing,Non-volatile memory,Bandwidth (signal processing),Memory management,Speedup | Journal |
Volume | Issue | ISSN |
38 | 4 | 0278-0070 |
Citations | PageRank | References |
2 | 0.38 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohsen Imani | 1 | 341 | 48.13 |
| Saransh Gupta | 2 | 101 | 11.58 |
| Sahil Sharma | 3 | 2 | 0.38 |
| Tajana Simunic | 4 | 3198 | 266.23 |