Towards an understanding of unbounded variables in asynchronous systems

https://doi.org/10.1016/0020-0190(92)90125-FGet rights and content

Abstract

The issue of bounded versus unbounded variables is examined in the context of asynchronous wait-free low-atomicity systems. Two closely related problems, only one of which can be solved using bounded variables, are presented. Later, these two problems are used to develop a hierarchical construction of atomic registers.

References (14)

  • B. Bloom

    Constructing two-writer atomic registers

    IEEE Trans. Comput.

    (1988)
    B. Bloom

    Constructing two-writer atomic registers

    Proc. Sixth Ann. ACM Symp. on Principles of Distributed Computing

    (1987)
  • J.E. Burns et al.

    Constructing multi-reader atomic values from non-atomic values

    Proc. Sixth Ann. ACM Symp. on Principles of Distributed Computing

    (1987)
  • P. Courtois et al.

    Concurrent control with readers and writers

    Comm. ACM

    (1971)
  • M. Herlihy

    Impossibility and universality results for wait-free synchronization

    Proc. Seventh Ann. ACM Symp. on Principles of Distributed Computing

    (1987)
  • S. Lam et al.

    Protocol verification via projections

    IEEE Trans. Software Eng.

    (1984)
  • L. Lamport

    On interprocess communication, Parts I and II

    Distributed Comput.

    (1986)
  • N. Lynch et al.

    The data link layer: Two impossibility results

    Proc. Eighth Ann. ACM Symp. on Principles of Distributed Computing

    (1989)
There are more references available in the full text version of this article.
∗

Work supported in part by NSF Grant CCR-9008628.

View full text
Copyright © 1992 Published by Elsevier B.V.