Results 21 to 30 of about 1,654,513 (343)
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
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
arXiv, 2021 We revisit the problem of building static hash tables on the GPU and design and build three bucketed hash tables that use different probing schemes. Our implementations are lock-free and offer efficient memory access patterns; thus, only the probing scheme is the factor affecting the performance of the hash table's different operations.
Awad, Muhammad A. +4 more
arxiv +3 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
Compact Parallel Hash Tables on the GPU [PDF]
arXivOn the GPU, hash table operation speed is determined in large part by cache line efficiency, and state-of-the-art hashing schemes thus divide tables into cache line-sized buckets. This raises the question whether performance can be further improved by increasing the number of entries that fit in such buckets.
Steef Hegeman +3 more
arxiv +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
Fast and accurate short-read alignment with hybrid hash-tree data structure [PDF]
Genomics & InformaticsRapidly increasing the amount of short-read data generated by NGSs (new-generation sequencers) calls for the development of fast and accurate read alignment programs.
Junichiro Makino +3 more
doaj +2 more sources
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