Supporting Lock-Free Composition of Concurrent Data Objects

Details Supporting Lock-Free Composition of Concurrent Data Objects Supporting Lock-Free Composition of Concurrent Data Objects

2009-10-02

arxiv.org/abs/0910.0366v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

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. But they share a common disadvantage in that the operations they provide are difficult to compose into larger atomic operations while still guaranteeing lock-freedom. 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 move operations to a wide range of concurrent objects. Experimental evaluation has shown that the operations originally supported by the data objects keep their performance behavior under our methodology.

Affiliated with

Also associated with

No associations

Rating

Supporting Lock-Free Composition of Concurrent Data Objects does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Supporting Lock-Free Composition of Concurrent Data Objects, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Supporting Lock-Free Composition of Concurrent Data Objects will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-26218