TY - GEN
T1 - Techniques for data-parallel searching for duplicate elements
AU - Lessley, Brenton
AU - Moreland, Kenneth
AU - Larsen, Matthew
AU - Childs, Hank
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/12/19
Y1 - 2017/12/19
N2 - We study effective shared-memory, data-parallel techniques for searching for duplicate elements. We consider several data-parallel approaches, and how hash function, machine architecture, and data set can affect performance. We conclude that most choices of algorithm and hash function are problematic for general usage. However, we demonstrate that the choice of the Hash-Fight algorithm with the FNV1a hash function has consistently good performance over all configurations.
AB - We study effective shared-memory, data-parallel techniques for searching for duplicate elements. We consider several data-parallel approaches, and how hash function, machine architecture, and data set can affect performance. We conclude that most choices of algorithm and hash function are problematic for general usage. However, we demonstrate that the choice of the Hash-Fight algorithm with the FNV1a hash function has consistently good performance over all configurations.
UR - http://www.scopus.com/inward/record.url?scp=85048417773&partnerID=8YFLogxK
U2 - 10.1109/LDAV.2017.8231845
DO - 10.1109/LDAV.2017.8231845
M3 - Conference contribution
AN - SCOPUS:85048417773
T3 - 2017 IEEE 7th Symposium on Large Data Analysis and Visualization, LDAV 2017
SP - 1
EP - 5
BT - 2017 IEEE 7th Symposium on Large Data Analysis and Visualization, LDAV 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 7th IEEE Symposium on Large Data Analysis and Visualization, LDAV 2017
Y2 - 2 October 2017
ER -