Concurrent Timestamping made simple

Gawlick, Rainer; Lynch, Nancy; Shavit, Nir

doi:10.1007/bfb0035176

Cited by 40 publications

(38 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Unlike the Bakery algorithm (and ours), the algorithm in [1] is not symmetric: process p i only reads the values of the lower processes. It is possible to replace the unbounded timestamps of the Bakery algorithm (i.e., taking a number) with bounded timestamps, as defined in [22] and constructed in [16,17,20], however the resulting algorithm will be rather complex, when the price of implementing bounded timestamps is taken into account.…”

Section: Related Workmentioning

confidence: 99%

The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms

Taubenfeld¹

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. A mutual exclusion algorithm is presented that has four desired properties: (1) it satisfies FIFO fairness, (2) it satisfies localspinning, (3) it is adaptive, and (4) it uses finite number of bounded size atomic registers. No previously published algorithm satisfies all these properties. In fact, it is the first algorithm (using only atomic registers) which satisfies both FIFO and local-spinning, and it is the first bounded space algorithm which satisfies both FIFO and adaptivity. All the algorithms presented are based on Lamport's famous Bakery algorithm [27], which satisfies FIFO, but uses unbounded size registers (and does not satisfy local-spinning and is not adaptive). Using only one additional shared bit, we bound the amount of space required by the Bakery algorithm by coloring the tickets taken in the Bakery algorithm. The resulting Black-White Bakery algorithm preserves the simplicity and elegance of the original algorithm, satisfies FIFO and uses finite number of bounded size registers. Then, in a sequence of steps (which preserve simplicity and elegance) we modify the new algorithm so that it is also adaptive to point contention and satisfies local-spinning.

show abstract

Section: Related Workmentioning

confidence: 99%

The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms

Taubenfeld¹

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The proof of their algorithm leverages the axiomatic proof in this paper by arguing that the executions of their algorithm are a subset of the executions of our algorithm. In [GLS92], Gawlick, Lynch, and Shavit introduce a streamlined version of our CTSS algorithm based on the use of an atomic snapshot primitive [AAD*89, And89a]. A snapshot primitive allows a process P i to update the ith memory location, or snap the memory, that is, collect an "instantaneous" view of all n shared-memory locations.…”

Section: Thus the Node L [C]mentioning

confidence: 99%

“…A simple solution based on transforming the unbounded protocol of Vitanyi and Awerbuch [VA86] using our construction (see [Sha90,G92]) has the same space complexity of the [PB87,Sch88] algorithm, yet it has a better time complexity-O(n) memory accesses for a write, O(n log n) for a read, as compared with O(n 2 ) for either in the former solutions. Our implementation is the only known bounded construction of an MRMW atomic register from single-writer multireader (SWMR) atomic registers where the implementation of the MRMW read operation does not require a process to perform an SWMR write.…”

mentioning

confidence: 99%

Bounded Concurrent Time-Stamping

Dolev¹,

Shavit²

1997

SIAM J. Comput.

Self Cite

View full text Add to dashboard Cite

Abstract. We introduce concurrent time-stamping, a paradigm that allows processes to temporally order concurrent events in an asynchronous shared-memory system. Concurrent time-stamp systems are powerful tools for concurrency control, serving as the basis for solutions to coordination problems such as mutual exclusion, -exclusion, randomized consensus, and multiwriter multireader atomic registers. Unfortunately, all previously known methods for implementing concurrent timestamp systems have been theoretically unsatisfying since they require unbounded-size time-stampsin other words, unbounded-size memory.This work presents the first bounded implementation of a concurrent time-stamp system, providing a modular unbounded-to-bounded transformation of the simple unbounded solutions to problems such as those mentioned above. It allows solutions to two formerly open problems, the boundedprobabilistic-consensus problem of Abrahamson and the fifo--exclusion problem of Fischer, Lynch, Burns and Borodin, and a more efficient construction of multireader multiwriter atomic registers.Key words. atomic registers, serialization, concurrency, time-stamping, distributed computing, parallel computing AMS subject classifications. 68Q22, 05C90, 05C99 PII. S0097539790192647 Introduction.A time-stamp system is like a ticket machine at an ice cream parlor. People's requests to buy the ice cream are time-stamped based on a numbered ticket (label) taken from the machine. In order to know the order in which requests will be served, a person need only scan through all the numbers and observe the order among them. A concurrent time-stamp system (CTSS) is a time-stamp system in which any process can either take a new ticket or scan the existing tickets simultaneously with other processes. A CTSS is required to be wait-free, which means that a process is guaranteed to finish any of the two above-mentioned label-taking or scanning tasks in a finite number of steps, even if other processes experience stopping failures. Wait-free algorithms are highly suited for fault-tolerant and real-time applications (see Herlihy [Her91]

show abstract

“…To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. SPAA'08, June [14][15][16]2008, Munich, Germany. Copyright 2008 ACM 978-1-59593-973-9/08/06 ...$5.00.…”

Section: Introductionmentioning

confidence: 99%

“…The snapshot object has proved to be an enormously useful abstraction. It has been used as a building block for solving many other problems, including approximate agreement [11], timestamping [16], randomized consensus [6,7] as well as several concurrent object constructions [8,17]. It could also be used in garbage collection, debugging distributed programs and storing checkpoints for data recovery.…”

Section: Introductionmentioning

confidence: 99%

Partial snapshot objects

Attiya

Guerraoui

Ruppert

2008

Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

We introduce a generalization of the atomic snapshot object, which we call the partial snapshot object. This object stores a vector of values. Processes may write components of the vector individually or atomically scan any subset of the components. We investigate implementations of the latter partial scan operation that are more efficient than the complete scans of traditional snapshot objects. We present an algorithm that is based on a new implementation of the active set abstraction, which may be of independent interest.

show abstract

Concurrent Timestamping made simple

Cited by 40 publications

References 9 publications

The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms

The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms

Bounded Concurrent Time-Stamping

Partial snapshot objects

Contact Info

Product

Resources

About