Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,426,051 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Hamming weight
Hash array mapped trie
Hazard pointer
List of data structures
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Analysis of Concurrent Lock-Free Hash Tries with Constant-Time Operations
Aleksandar Prokopec
arXiv.org
2017
Corpus ID: 40520939
Ctrie is a scalable concurrent non-blocking dictionary data structure, with good cache locality, and non-blocking linearizable…
Expand
2015
2015
Design and implementation of the ctrie-hash algorithm for fast routing lookup
Junjun Zhang
,
Qinghua Chen
,
Lufeng Qiao
,
J. Wang
,
Jian Yang
International Congress on Image and Signal…
2015
Corpus ID: 17397714
The rapid development of IP networks requires high performance routers. The fast routing lookup engine in routers is a key…
Expand