Heterogeneous CPU-GPU Epsilon Grid Joins: Static and Dynamic Work Partitioning Strategies
Heterogeneous CPU-GPU Epsilon Grid Joins: Static and Dynamic Work Partitioning Strategies
复制标题
DOI:
10.1007/s41019-020-00145-x
复制
发表时间:
2020-10
影响因子:
4.2
通讯作者:
Benoît Gallet;M. Gowanlock
中科院分区:
文献类型:
--
作者:
Benoît Gallet;M. Gowanlock
Given two datasets (or tables)AandBand a search distance, the distance similarity join, denoted as, finds the pairs of points (,), whereand, and such that the distance betweenandis. If, then the similarity join is equivalent to a similarity self-join, denoted as. We propose in this paper Heterogeneous Epsilon Grid Joins (HEGJoin), a heterogeneous CPU-GPU distance similarity join algorithm. Efficiently partitioning the work between the CPU and the GPU is a challenge. Indeed, the work partitioning strategy needs to consider the different characteristics and computational throughput of the processors (CPU and GPU), as well as the data-dependent nature of the similarity join that accounts in the overall execution time (e.g., the number of queries, their distribution, the dimensionality, etc.). In addition toHEGJoin, we design in this paper a dynamic and two static work partitioning strategies. We also propose a performance model for each static partitioning strategy to perform the distribution of the work between the processors. We evaluate the performance of all three partitioning methods by considering the execution time and the load imbalance between the CPU and GPU as performance metrics.HEGJoinachieves a speedup of up to() over the GPU-only (CPU-only) algorithms on our first test platform and up to() on our second test platform over the GPU-only (CPU-only) algorithms.