Results 1 to 10 of about 1,628,666 (344)
Analysing the Performance of GPU Hash Tables for State Space Exploration [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 In the past few years, General Purpose Graphics Processors (GPUs) have been used to significantly speed up numerous applications. One of the areas in which GPUs have recently led to a significant speed-up is model checking.
Nathan Cassee, Anton Wijs
doaj +19 more sources
Hyperdimensional hashing [PDF]
Proceedings of the 59th ACM/IEEE Design Automation Conference, 2022 Most cloud services and distributed applications rely on hashing algorithms that allow dynamic scaling of a robust and efficient hash table. Examples include AWS, Google Cloud and BitTorrent. Consistent and rendezvous hashing are algorithms that minimize key remapping as the hash table resizes.
Heddes, Mike +4 more
openaire +3 more sources
FASTHash: FPGA-Based High Throughput Parallel Hash Table [PDF]
High Performance Computing35th International Conference, 2020 Hash table is a fundamental data structure that provides efficient data store and access. It is a key component in AI applications which rely on building a model of the environment using observations and performing lookups on the model for newer ...
Yang Y +4 more
europepmc +2 more sources
Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once [PDF]
Journal of the ACM, 2023 Despite being one of the oldest data structures in computer science, hash tables continue to be the focus of a great deal of both theoretical and empirical research. A central reason for this is that many of the fundamental properties that one desires from a hash table are difficult to achieve simultaneously; thus many variants offering different trade-
Michael A. Bender +4 more
openaire +4 more sources
Comparison on Search Failure between Hash Tables and a Functional Bloom Filter [PDF]
Applied Sciences, 2020 Hash-based data structures have been widely used in many applications. An intrinsic problem of hashing is collision, in which two or more elements are hashed to the same value. If a hash table is heavily loaded, more collisions would occur. Elements that
Hayoung Byun, Hyesook Lim
doaj +2 more sources
Communications of the ACM, 1988 Linear hashing and spiral storage are two dynamic hashing schemes originally designed for external files. This paper shows how to adapt these two methods for hash tables stored in main memory. The necessary data structures and algorithms are described, the expected performance is analyzed mathematically, and actual execution times are obtained and ...
Per-Åke Larson
openalex +3 more sources
Image Encryption Based on Hash Table Scrambling and DNA Substitution
IEEE Access, 2020 This paper proposes an image encryption algorithm based on hash table structure scrambling and DNA substitution. The algorithm uses the classical `scrambling-diffusion' process, and the pseudo-random sequence used in each process is generated by the ...
Xingyuan Wang, Lin Liu
doaj +2 more sources
SAHA: A String Adaptive Hash Table for Analytical Databases
Applied Sciences, 2020 Hash tables are the fundamental data structure for analytical database workloads, such as aggregation, joining, set filtering and records deduplication. The performance aspects of hash tables differ drastically with respect to what kind of data are being
Tianqi Zheng, Zhibin Zhang, Xueqi Cheng
doaj +2 more sources
Authentication in stealth distributed hash tables [PDF]
Journal of Systems Architecture, 2008 Most existing DHT algorithms assume that all nodes have equal capabilities. This assumption has previously been shown to be untrue in real deployments, where the heterogeneity of nodes can actually have a detrimental effect upon performance. In this paper, we acknowledge that nodes on the same overlay may also differ in terms of their trustworthiness ...
Andrew MacQuire +4 more
openalex +6 more sources
A Dynamic Hash Table for the GPU
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2018 We design and implement a fully concurrent dynamic hash table for GPUs with comparable performance to the state of the art static hash tables. We propose a warp-cooperative work sharing strategy that reduces branch divergence and provides an efficient alternative to the traditional way of per-thread (or per-warp) work assignment and processing.
Ashkiani, Saman +2 more
openaire +4 more sources