Results 1 to 10 of about 1,755,139 (205)

Analysing the Performance of GPU Hash Tables for State Space Exploration [PDF]

open access: yesElectronic 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   +20 more sources

FASTHash: FPGA-Based High Throughput Parallel Hash Table [PDF]

open access: yesHigh 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

Key Concepts, Weakness and Benchmark on Hash Table Data Structures

open access: yesAlgorithms, 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   +2 more sources

Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once [PDF]

open access: yesJournal 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

Hyperdimensional hashing [PDF]

open access: yesProceedings 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

Image Encryption Based on Hash Table Scrambling and DNA Substitution

open access: yesIEEE 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

open access: yesApplied 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 Distributed Hash Table for Shared Memory [PDF]

open access: yesParallel Processing and Applied Mathematics, 2015
Distributed algorithms for graph searching require a high-performance CPU-efficient hash table that supports find-or-put. This operation either inserts data or indicates that it has already been added before.
Wytse Oortwijn, T. V. Dijk, J. Pol
semanticscholar   +5 more sources

Instant neural graphics primitives with a multiresolution hash encoding [PDF]

open access: yesACM Transactions on Graphics, 2022
Neural graphics primitives, parameterized by fully connected neural networks, can be costly to train and evaluate. We reduce this cost with a versatile new input encoding that permits the use of a smaller network without sacrificing quality, thus ...
T. Müller   +3 more
semanticscholar   +1 more source

A new hash function and its use in read mapping on genome [PDF]

open access: yesAUT Journal of Mathematics and Computing, 2020
Mapping reads onto genomes is an indispensable step in sequencing data analysis. A widely used method to speed up mapping is to index a genome by a hash table, in which genomic positions of $k$-mers are stored in the table.
Farzaneh Salari   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy