Results 11 to 20 of about 1,628,666 (344)
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
Efficient hash tables for network applications [PDF]
SpringerPlus, 2015 Hashing has yet to be widely accepted as a component of hard real-time systems and hardware implementations, due to still existing prejudices concerning the unpredictability of space and time requirements resulting from collisions. While in theory perfect hashing can provide optimal mapping, in practice, finding a perfect hash function is too expensive,
Thomas Zink, Marcel Waldvogel
openalex +6 more sources
Accelerating Hash-Based Query Processing Operations on FPGAs by a Hash Table Caching Technique [PDF]
Latin American Conference on High Performance Computing, 2016 Extracting valuable information from the rapidly growing field of Big Data faces serious performance constraints, especially in the software-based database management systems (DBMS).
Behzad Salami +4 more
semanticscholar +2 more sources
A Distributed Hash Table for Shared Memory [PDF]
Parallel 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
Host Identity Protocol Distributed Hash Table Interface [PDF]
Request for Comments, 2012 This document specifies a common interface for using the Host Identity Protocol (HIP) with a Distributed Hash Table (DHT) service to provide a name-to-Host-Identity-Tag lookup service and a Host- Identity-Tag- to-address lookup service.
Jeff Ahrenholz
openalex +2 more sources
International Journal of Engineering and Advanced Technology, 2019 Randomized computations must work. Following a long time of awful examination into transformative programming, we check the generation of XML, which exemplifies the fitting gauges of frameworks organization. We use perfect epistemologies to disconfirm that red-dull trees [2] and neighborhood can scheme to comprehend this desire [4].
S. Pothumani, R. K. Kavitha, R Velvizhi
openalex +2 more sources
CPHASH: a cache-partitioned hash table [PDF]
ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, 2012 CPHash is a concurrent hash table for multicore processors. CPHash partitions its table across the caches of cores and uses message passing to transfer lookups/inserts to a partition.
Z. Metreveli +2 more
semanticscholar +4 more sources
Instant neural graphics primitives with a multiresolution hash encoding [PDF]
ACM 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]
AUT 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
Probabilistic behavior of hash tables
, 2003 We extend a result of Goldreich and Ron about estimating the collision probability of a hash function. Their estimate has a polynomial tail. We prove that when the load factor is greater than a certain constant, the estimator has a gaussian tail.
Dawei Hong +2 more
openalex +4 more sources