Bounded Concurrent Timestamp Systems Using Vector Clocks

Details Bounded Concurrent Timestamp Systems Using Vector Clocks Bounded Concurrent Timestamp Systems Using Vector Clocks

2001-08-02

arxiv.org/abs/cs/0108002v1

Computer Science

Distributed, Parallel, and Cluster Computing

LaTeX source, 35 pages; To apper in: J. Assoc. Comp. Mach

Scientific paper

Shared registers are basic objects used as communication mediums in asynchronous concurrent computation. A concurrent timestamp system is a higher typed communication object, and has been shown to be a powerful tool to solve many concurrency control problems. It has turned out to be possible to construct such higher typed objects from primitive lower typed ones. The next step is to find efficient constructions. We propose a very efficient wait-free construction of bounded concurrent timestamp systems from 1-writer multireader registers. This finalizes, corrects, and extends, a preliminary bounded multiwriter construction proposed by the second author in 1986. That work partially initiated the current interest in wait-free concurrent objects, and introduced a notion of discrete vector clocks in distributed algorithms.

Affiliated with

Also associated with

No associations

Rating

Bounded Concurrent Timestamp Systems Using Vector Clocks 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 Bounded Concurrent Timestamp Systems Using Vector Clocks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounded Concurrent Timestamp Systems Using Vector Clocks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-186581