In addition, the proposed solution also implements a general doubly linked list, the first lock-free implementation that only needs the single-word compare-and-swap atomic primitive. 展开 关键词: CiteSeerX citations Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare...
Lock-free deques and doubly linked lists Our algorithm only requires single-word compare-and-swap atomic primitives, supports fully dynamic list sizes, and allows traversal also through deleted nodes... Hakan Sundell,P Tsigas - 《Journal of Parallel & Distributed Computing》 被引量: 76发表: 2008...