Results 51 to 60 of about 1,654,513 (343)
Comparison of Hash Table Performance with Open Addressing and Closed Addressing: An Empirical Study [PDF]
In this paper, we conducted empirical experiments to study the performance of hashing with a large set of data and compared the results of different collision approaches. The experiment results leaned more to closed addressing than to open addressing and
Dapeng Liu, Shaochun Xu
doaj +1 more source
Distributed Paged Hash Tables [PDF]
In this paper we present the design and implementation of DPH, a storage layer for cluster environments. DPH is a Distributed Data Structure (DDS) based on the distribution of a paged hash table. It combines main memory with file system resources across the cluster in order to implement a distributed dictionary that can be used for the storage of very ...
Rufino, José+3 more
openaire +3 more sources
Semi-supervised hash learning method with consistency-based dimensionality reduction
With the explosive growth of surveillance data, exact match queries become much more difficult for its high dimension and high volume. Owing to its good balance between the retrieval performance and the computational cost, hash learning technique is ...
Fang Lv+3 more
doaj +1 more source
Research of a Scheduling Optimization algorithm based on Hash Adapter
The performance of hash-based Scheduling optimization algorithm for network flow cannot be bounded under the worst-case because of hash conflicts. To make up for the shortage of the above algorithm, a multiple-hash algorithm based on counting Hash ...
Yang Wenchuan, Fu Zhen, Zuo Wen
doaj +1 more source
On the Scalability of the GPUexplore Explicit-State Model Checker [PDF]
The use of graphics processors (GPUs) is a promising approach to speed up model checking to such an extent that it becomes feasible to instantly verify software systems during development.
Nathan Cassee, Thomas Neele, Anton Wijs
doaj +1 more source
Hash tables are an essential data-structure for numerous networking applications (e.g., connection tracking, firewalls, network address translators). Among these, cuckoo hash tables provide excellent performance by allowing lookups to be processed with very few memory accesses (2 to 3 per lookup). Yet, for large tables, cuckoo hash tables remain memory
openaire +3 more sources
Hash Table Design and Optimization for Software Virtual Switches
Flow classification is a common first step in various virtual network functions (VNFs), Software Defined Networking (SDN) applications, as well as network infrastructure components including virtual switches and routers.
Yipeng Wang+4 more
semanticscholar +1 more source
Novel distributed Hash table——BChord
A novel distributed Hash table(DHT) BChord was presented. BChord adopts bi-directional search mechanism of Chord. Though query items of finger table in BChord almost double to Chord, compared with Chord, BChord evi- dently increases speed at searching of
ZHENG Yan1+3 more
doaj +2 more sources
ESH: Design and Implementation of an Optimal Hashing Scheme for Persistent Memory
Recent advancements in memory technology have opened up a wealth of possibilities for innovation in data structures. The emergence of byte-addressable persistent memory (PM) with its impressive capacity and low latency has accelerated the adoption of PM ...
Dereje Regassa+2 more
doaj +1 more source
Improved Session Table Architecture for Denial of Stateful Firewall Attacks
Stateful firewalls keep track of the state of network connections. The performance of stateful firewalls depends mainly on the processing of session tables and the mechanism used for packet filtering.
Zouheir Trabelsi+3 more
doaj +1 more source