非阻塞Patricia尝试使用Replace操作
Non-blocking Patricia Tries with Replace Operations
摘要:
本文提出了一种非阻塞Patricia trie实现的异步共享内存系统使用比较和交换。trie实现了一个可线性化的集合,并支持三种更新操作:插入添加一个元素,删除删除一个元素,替换一个元素。替换操作很有趣,因为它原子地改变了树的两个不同位置。如果所有的更新操作都修改了trie的不同部分,它们将完全并发地运行。该实现还支持无等待查找操作,该操作仅读取共享内存,并且从不更改数据结构。从经验上讲,我们比较我们的算法,一些现有的集实现。
英文摘要:
This paper presents a non-blocking Patricia trie implementation for an asynchronous shared-memory system using Compare&Swap. The trie implements a linearizable set and supports three update operations: insert adds an element, delete removes an element and replace replaces one element by another. The replace operation is interesting because it changes two different locations of tree atomically. If all update operations modify different parts of the trie, they run completely concurrently. The implementation also supports a wait-free find operation, which only reads shared memory and never changes the data structure. Empirically, we compare our algorithms to some existing set implementations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。