Two-enqueuer queue in Common2

Details Two-enqueuer queue in Common2 Two-enqueuer queue in Common2

2008-05-04

arxiv.org/abs/0805.0444v2

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

The question of whether all shared objects with consensus number 2 belong to Common2, the set of objects that can be implemented in a wait-free manner by any type of consensus number 2, was first posed by Herlihy. In the absence of general results, several researchers have obtained implementations for restricted-concurrency versions of FIFO queues. We present the first Common2 algorithm for a queue with two enqueuers and any number of dequeuers.

Affiliated with

Also associated with

No associations

Rating

Two-enqueuer queue in Common2 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 Two-enqueuer queue in Common2, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two-enqueuer queue in Common2 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-208424