TY - GEN
T1 - Concurrent updates with RCU
T2 - 2014 ACM Symposium on Principles of Distributed Computing, PODC 2014
AU - Arbel, Maya
AU - Attiya, Hagit
PY - 2014
Y1 - 2014
N2 - Read copy update (RCU) is a novel synchronization mechanism, in which the burden of synchronization falls completely on the updaters, by having them wait for all pre-existing readers to finish their read-side critical section. This paper presents Citrus, a concurrent binary search tree (BST) with a wait-free contains operation, using RCU synchronization and fine-grained locking for synchronization among updaters. This is the first RCU-based data structure that allows concurrent updaters. While there are methodologies for using RCU to coordinate between readers and updaters, they do not address the issue of coordination among updaters, and indeed, all existing RCU-based data structures rely on coarse-grained synchronization between updaters. Experimental evaluation shows that CITRUS beats previous RCU-based search trees, even under mild update contention, and compares well with the best-known concurrent dictionaries.
AB - Read copy update (RCU) is a novel synchronization mechanism, in which the burden of synchronization falls completely on the updaters, by having them wait for all pre-existing readers to finish their read-side critical section. This paper presents Citrus, a concurrent binary search tree (BST) with a wait-free contains operation, using RCU synchronization and fine-grained locking for synchronization among updaters. This is the first RCU-based data structure that allows concurrent updaters. While there are methodologies for using RCU to coordinate between readers and updaters, they do not address the issue of coordination among updaters, and indeed, all existing RCU-based data structures rely on coarse-grained synchronization between updaters. Experimental evaluation shows that CITRUS beats previous RCU-based search trees, even under mild update contention, and compares well with the best-known concurrent dictionaries.
KW - Internal search tree
KW - Read-copy-update
KW - Shared memory
UR - http://www.scopus.com/inward/record.url?scp=84905457495&partnerID=8YFLogxK
U2 - 10.1145/2611462.2611471
DO - 10.1145/2611462.2611471
M3 - منشور من مؤتمر
SN - 9781450329446
T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
SP - 196
EP - 205
BT - PODC 2014 - Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing
Y2 - 15 July 2014 through 18 July 2014
ER -