Simple extensions of 1-writer atomic variable constructions to multiwriter ones

Haldar, S.; Vidyasankar, K.

doi:10.1007/s002360050040

Cited by 8 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Together with Attiya, Lynch, and Shavit's log 2 n lower bound for single-writer registers, this implies that any wait-free implementation of registers from single-writer registers has round complexity Ω(log n). However, there is a large gap between this lower bound and the best known implementation [164]. It also remains open whether approximate agreement can be solved in fewer rounds using larger registers.…”

Section: Approximate Agreementmentioning

confidence: 93%

Hundreds of impossibility results for distributed computing

Fich

Ruppert

2003

Distributed Computing

124

View full text Add to dashboard Cite

We survey results from distributed computing that show tasks to be impossible, either outright or within given resource bounds, in various models. The parameters of the models considered include synchrony, fault-tolerance, different communication media, and randomization. The resource bounds refer to time, space and message complexity. These results are useful in understanding the inherent difficulty of individual problems and in studying the power of different models of distributed computing. There is a strong emphasis in our presentation on explaining the wide variety of techniques that are used to obtain the results described.

show abstract

Section: Approximate Agreementmentioning

confidence: 93%

Hundreds of impossibility results for distributed computing

Fich

Ruppert

2003

Distributed Computing

124

View full text Add to dashboard Cite

show abstract

“…In the atomic register area ( [Awerbuch et al 1988;Kirousis and Kranakis 1989;Lamport 1985]), ww defines regularity, and ww and no have been shown to imply atomicity in the 1-writer case (Proposition 8). In [Haldar and Vidyasankar 1996], ww, no and another illegality have been used to characterize atomicity in multiwriter registers. The bad cases for atomicity, given in Peterson and Burns [1987], include ww, rw and a variation of rr-illegality (BC1).…”

Section: Discussionmentioning

confidence: 99%

On specification of Read/Write shared variables

Haldar

Vidyasankar

2007

J. ACM

Self Cite

View full text Add to dashboard Cite

A shared variable is an abstraction of persistent interprocess communication. Processors execute operations, often concurrently, on shared variables to exchange information among themselves. The behavior of operation executions is required to be "consistent" for effective interprocess communication. Consequently, a consistency specification of a shared variable describes some guarantees on the behavior of the operation executions. A Read/Write shared variable has two operations: a Write stores a specified value in the variable and a Read returns a value from the variable. For Read/Write variables, a consistency specification describes what values Reads may return. Using an intuitive notion of illegality of Reads, we propose a framework that facilitates specifying a large variety of Read/Write variables.

show abstract

“…(In this paper we correct and extend the first construction to obtain an efficient version of the more general notion of bounded concurrent timestamp system as defined below.) Related work is [1,5,6,16,17,19,23,24,29,30,31,34,35,36,37,38,40]. In particular, it is now possible to construct bounded multiwriter atomic variables from 1-writer 1-reader safe bits.…”

Section: Introductionmentioning

confidence: 99%

Bounded concurrent timestamp systems using vector clocks

Haldar¹,

Vitányi

2002

J. ACM

View full text Add to dashboard Cite

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.

show abstract

Simple extensions of 1-writer atomic variable constructions to multiwriter ones

Cited by 8 publications

References 6 publications

Hundreds of impossibility results for distributed computing

Hundreds of impossibility results for distributed computing

On specification of Read/Write shared variables

Bounded concurrent timestamp systems using vector clocks

Contact Info

Product

Resources

About