Skip to search formSkip to main contentSkip to account menu

Ctrie

Known as: Concurrent hash trie, Concurrent hash-trie 
A concurrent hash-trie or Ctrie is a concurrent thread-safe lock-free implementation of a hash array mapped trie. It is used to implement the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Hamming weightHash array mapped trieHazard pointerList of data structures

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Cache-Aware Lock-Free Concurrent Hash Tries
This report describes an implementation of a non-blocking concurrent shared-memory hash trie based on single-word compare-and… 
2017
2017
Analysis of Concurrent Lock-Free Hash Tries with Constant-Time Operations
Ctrie is a scalable concurrent non-blocking dictionary data structure, with good cache locality, and non-blocking linearizable… 
2015
2015
Design and implementation of the ctrie-hash algorithm for fast routing lookup
The rapid development of IP networks requires high performance routers. The fast routing lookup engine in routers is a key… 
2011
2011
Lock-Free Resizeable Concurrent Tries
This paper describes an implementation of a non-blocking concurrent hash trie based on single-word compare-and-swap instructions… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)