technicolor-research / cuckooppLinks
A high-performance hash-table for network packet-processing applications (compatible with DPDK)
☆38Updated 7 years ago
Alternatives and similar repositories for cuckoopp
Users that are interested in cuckoopp are comparing it to the libraries listed below
Sorting:
- A fast in-memory key-value store☆52Updated 8 years ago
- Concurrent trie-hash map library☆94Updated 2 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 4 years ago
- ☆35Updated 6 years ago
- QSBR and EBR library☆135Updated 6 years ago
- TAS is a drop-in highly CPU efficient and scalable TCP acceleration service.☆91Updated 2 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA☆79Updated 5 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆84Updated 3 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated 2 years ago
- A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆42Updated last year
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Remote Persistent Memory Access Library☆105Updated 2 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- C library implementing cuckoo hash☆51Updated 13 years ago
- Fast Approximate Membership Filters (C++)☆289Updated 5 months ago
- An adaptive radix tree for efficient indexing in main memory.☆170Updated 2 months ago
- ☆31Updated 6 years ago
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆24Updated 2 years ago
- Library for lock-free locks☆84Updated 2 years ago
- ☆24Updated 3 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆182Updated 8 years ago
- A simple, reference implementation of a B^e-tree☆163Updated 6 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Persistent memory allocator for data-centric analytics☆60Updated 3 months ago
- DFC: High performance string pattern matching☆30Updated 4 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- A minimal UDP stack based on DPDK☆136Updated 4 years ago
- a high performance cache simulator and library☆112Updated last year