Techniques for data-parallel searching for duplicate elements

Brenton Lessley, Kenneth Moreland, Matthew Larsen, Hank Childs

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publication2017 IEEE 7th Symposium on Large Data Analysis and Visualization, LDAV 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-5
Number of pages5
ISBN (Electronic)9781538606179
DOIs
StatePublished - Dec 19 2017
Externally publishedYes
Event7th IEEE Symposium on Large Data Analysis and Visualization, LDAV 2017 - Phoenix, United States
Duration: Oct 2 2017 → …

Publication series

Name2017 IEEE 7th Symposium on Large Data Analysis and Visualization, LDAV 2017
Volume2017-December

Conference

Conference7th IEEE Symposium on Large Data Analysis and Visualization, LDAV 2017
Country/TerritoryUnited States
CityPhoenix
Period10/2/17 → …

Fingerprint

Dive into the research topics of 'Techniques for data-parallel searching for duplicate elements'. Together they form a unique fingerprint.

Cite this