Results 11 to 20 of about 1,500,333 (340)
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
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 +5 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
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
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
An Efficient Wait-free Resizable Hash Table [PDF]
ACM Symposium on Parallelism in Algorithms and Architectures, 2018 This paper presents an efficient wait-free resizable hash table. To achieve high throughput at large core counts, our algorithm is specifically designed to retain the natural parallelism of concurrent hashing, while providing wait-free resizing.
Panagiota Fatourou +2 more
openalex +3 more sources
Mathematics, 2023 Chaotic systems, especially hyper-chaotic systems are suitable for digital image encryption because of their complex properties such as pseudo randomness and extreme sensitivity. This paper proposes a new color image encryption algorithm based on a hyper-
Xiaoyuan Wang +5 more
semanticscholar +1 more source
Host Identity Protocol Distributed Hash Table Interface [PDF]
Request for Comments, 2012 Jeff Ahrenholz
openalex +2 more sources
Key Concepts, Weakness and Benchmark on Hash Table Data Structures
Algorithms, 2022 Most computer programs or applications need fast data structures. The performance of a data structure is necessarily influenced by the complexity of its common operations; thus, any data-structure that exhibits a theoretical complexity of amortized ...
Santiago Tapia-Fernández +2 more
doaj +1 more source