Simple Optimal Wait-free Multireader Registers

Details Simple Optimal Wait-free Multireader Registers Simple Optimal Wait-free Multireader Registers

2002-02-04

arxiv.org/abs/cs/0202003v3

Computer Science

Distributed, Parallel, and Cluster Computing

11 pages LaTeX, 1 table, 2 pseudo-programs; previous version published in Proc 16th International Symposium on DIStributed Com

Scientific paper

Multireader shared registers are basic objects used as communication medium in asynchronous concurrent computation. We propose a surprisingly simple and natural scheme to obtain several wait-free constructions of bounded 1-writer multireader registers from atomic 1-writer 1-reader registers, that is easier to prove correct than any previous construction. Our main construction is the first symmetric pure timestamp one that is optimal with respect to the worst-case local use of control bits; the other one is optimal with respect to global use of control bits; both are optimal in time.

Affiliated with

Also associated with

No associations

Rating

Simple Optimal Wait-free Multireader Registers 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 Simple Optimal Wait-free Multireader Registers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simple Optimal Wait-free Multireader Registers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-345731