2015 International Conference on Parallel Architecture and Compilation (PACT) 2015
DOI: 10.1109/pact.2015.13
|View full text |Cite
|
Sign up to set email alerts
|

Stadium Hashing: Scalable and Flexible Hashing on GPUs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(10 citation statements)
references
References 11 publications
0
10
0
Order By: Relevance
“…In the research process of CHT implementation in the CPUGPU heterogeneous environment, Horton tables [10] adopted the additional space and additional hash mapping function to replace the original replacement method in the case there are no free slots. Stadium hashing [11] used the combination of CPU and GPU to improve the performance; i.e., it stores the keys in the GPU and the values in the CPU memory. The operations on CPU and GPU are distinguished by adding an auxiliary data structure (ticket board), which allows concurrent execution of read and write operations on the same hash table.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In the research process of CHT implementation in the CPUGPU heterogeneous environment, Horton tables [10] adopted the additional space and additional hash mapping function to replace the original replacement method in the case there are no free slots. Stadium hashing [11] used the combination of CPU and GPU to improve the performance; i.e., it stores the keys in the GPU and the values in the CPU memory. The operations on CPU and GPU are distinguished by adding an auxiliary data structure (ticket board), which allows concurrent execution of read and write operations on the same hash table.…”
Section: Related Workmentioning
confidence: 99%
“…In a recent work on hash tables, the Cuckoo Hash Table (CHT) [9] has been proposed; it is based on the cuckoo algorithm and it maps the original single data into multiple buckets. CHT replaces the mapping and the linked list operations of the traditional hash tables and has the characteristics of fast access and saving space, which has been widely applied and studied in the hash table management [10][11][12] and data storage systems [4,8,[13][14][15][16] .…”
mentioning
confidence: 99%
“…Future hashing approaches should assess the performance benefits of ticketing even when off-device accesses do not occur. Maintaining the ticketing structure in shared memory appears to be particularly beneficial, as demonstrated by the StadiumHash openaddressing technique [58].…”
Section: Analysis and Future Workmentioning
confidence: 99%
“…due to synchronization failures. Whereas previous approaches either allow failures [14,22,39] or do not ensure key uniqueness [2,25], our robust hash data structure is not limited in this regard and represents the key to realize our real-time remote collaboration system. A detailed evaluation in terms of design choices and runtime performance can be found in the supplemental material.…”
Section: Hash Map and Set Data Structuresmentioning
confidence: 99%