منابع مشابه
Split-Ordered Lists: Lock-Free Extensible Hash Tables (a summary)
The hash table is a common data structure for applications requiring constant time insert, delete and find of certain items. The basic idea is to use an array of buckets, where each bucket stores a list of items. A hash function is used to determine which bucket a certain item belongs to. Finding or deleting a specific item amounts to a linear search in a bucket list pointed to by the hash func...
متن کاملSplit-Ordered Lists - Lock-free Resizable Hash Tables
We present the first lock-free implementation of an extensible hash table running on current architectures. Our algorithm provides concurrent insert, delete, and search operations with an expected O(1) cost. It consists of very simple code, easily implementable using only load, store, and compare-and-swap operations. The new mathematical structure at the core of our algorithm is recursive split...
متن کاملCuckoo++ Hash Tables: High-Performance Hash Tables for Networking Applications
Hash tables are an essential data-structure for numerous networking applications (e.g., connection tracking, rewalls, 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 bound and each memory access impacts perform...
متن کاملDistributed Paged Hash Tables
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 large data sets with key based addressing t...
متن کاملOptimal Dynamic Hash Tables
Hash-based data structures, which use randomization in order to represent efficiently a list of elements, are one of the most-used data structures in networking applications, where both time and fast memory are scarce resources. This paper investigates the realistic scenario in which elements are not only added to the data structure but also deleted. We show that when the memory is bounded, dyn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1974
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/17.2.135