Lock-free data objects offer several advantages over their blocking counterparts, such as
being immune to deadlocks and convoying and, more importantly, being highly concurrent.
However, composing the operations they provide into larger atomic operations, while still
guaranteeing efficiency and lock-freedom, is a challenging algorithmic task. We present a
lock-free methodology for composing highly concurrent linearizable objects together by
unifying their linearization points. This makes it possible to relatively easily introduce atomic …

Lock-free data objects offer several advantages over their blocking counterparts, such as
being immune to deadlocks, priority inversion, and convoying. They have also been shown
to work well in practice. However, composing the operations they provide into larger atomic
operations, while still guaranteeing efficiency and lock-freedom, is a challenging algorithmic
task. We present a lock-free methodology for composing a wide variety of concurrent
linearizable objects together by unifying their linearization points. This makes it possible to …