FPGA-based Data Partitioning
Authors:
Open Access
- 9 May 2017
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 433-445
Abstract
Implementing parallel operators in multi-core machines often involves a data partitioning step that divides the data into cache-size blocks and arranges them so to allow concurrent threads to process them in parallel. Data partitioning is expensive, in some cases up to 90% of the cost of, e.g., a parallel hash join. In this paper we explore the use of an FPGA to accelerate data partitioning. We do so in the context of new hybrid architectures where the FPGA is located as a co-processor residing on a socket and with coherent access to the same memory as the CPU residing on the other socket. Such an architecture reduces data transfer overheads between the CPU and the FPGA, enabling hybrid operator execution where the partitioning happens on the FPGA and the build and probe phases of a join happen on the CPU. Our experiments demonstrate that FPGA-based partitioning is significantly faster and more robust than CPU-based partitioning. The results open interesting options as FPGAs are gradually integrated tighter with the CPU.Keywords
This publication has 37 references indexed in Scilit:
- Distributed join algorithms on thousands of coresProceedings of the VLDB Endowment, 2017
- Accelerating Equi-Join on a CPU-FPGA Heterogeneous Platform2016
- FPGA-accelerated group-by aggregation using synchronizing caches2016
- Rack-Scale In-Memory Join Processing using RDMA2015
- Memory-efficient hash joinsProceedings of the VLDB Endowment, 2014
- Hardware acceleration of database operations2014
- Multi-core, main-memory joinsProceedings of the VLDB Endowment, 2013
- Accelerating Join Operation for Relational Databases with FPGAs2013
- Main-memory hash joins on multi-core CPUs: Tuning to the underlying hardware2013
- Design and evaluation of main memory hash join algorithms for multi-core CPUs2011