Name
Abstract | ||
|---|---|---|
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 shared 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. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1145/505241.505246 | Journal of the ACM (JACM) |
Keywords | DocType | Volume |
concurrency control,vector clock,distributed algorithm,label,traceability | Journal | 49 |
Issue | ISSN | Citations |
1 | 0004-5411 | 17 |
PageRank | References | Authors |
0.79 | 36 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sibsankar Haldar | 1 | 28 | 2.83 |
| Paul Vitányi | 2 | 2130 | 287.76 |