Skip to main content
Springer Nature Link
Log in

An axiomatization of wait-freedom and low-atomicity

  • Theory Of Computing, Algorithms And Programming
  • Conference paper
  • First Online:
Advances in Computing and Information — ICCI '90 (ICCI 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 468))

Included in the following conference series:

  • 143 Accesses

Abstract

The concepts of wait-freedom and low-atomicity in concurrent shared-variable programs are explored in the frameworks of temporal logic and UNITY. With the help of some new primitives, axioms for these concepts are presented. Later, these axioms are used to prove the impossibility of distributed consensus.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Anderson, J. H., and M. G. Gouda, The Virtue of Patience: Concurrent Programming With and Without Waiting, work in progress.

    Google Scholar 

  2. Chandy, K. M., and J. Misra, Parallel Program Design: A Foundation, Reading, Massachusetts: Addison-Wesley, 1988.

    Google Scholar 

  3. Emerson, E. A., and J. Y. Halpern, “Sometimes” and “Not Never” Revisited: On Branching Time versus Linear Time Temporal Logic, Journal of the ACM, 33(1), January 1986, pp. 151–178.

    Google Scholar 

  4. Fischer, M., N. Lynch, and M. Patterson, Impossibility of Distributed Consensus with One Faulty Process, Second Annual ACM Symposium on the Principles of Distributed Computing, 1983, pp. 1–7.

    Google Scholar 

  5. Herlihy, M., Impossibility and Universality Results for Wait-free Synchronization, Seventh Annual ACM Symposium on the Principles of Distributed Computing, 1987, pp. 276–290.

    Google Scholar 

  6. Lamport, L., On Interprocess Communication, parts I and II, Distributed Computing, 1(2), 1986, pp. 77–101.

    Google Scholar 

  7. Manna, Z., and A. Pnueli, Adequate Proof Principles for Invariance and Liveness Properties of Concurrent Programs, Science of Computer Programming, 4, 1984, pp. 257–289.

    Google Scholar 

  8. Peterson, G. L., and J. E. Burns, Concurrent Reading While Writing II: the Multi-writer Case, Twenty-eighth Annual Symposium on the Foundations of Computer Science, 1987, pp. 383–392.

    Google Scholar 

  9. Singh, A. K., J. H. Anderson, and M. G. Gouda, The Elusive Atomic Register Revisited, Sixth Annual ACM Symposium on the Principles of Distributed Computing, 1987, pp. 206–221.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California at Santa Barbara, 93106, Santa Barbara, California

    Ambuj K. Singh

Authors
  1. Ambuj K. Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. G. Akl F. Fiala W. W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Singh, A.K. (1991). An axiomatization of wait-freedom and low-atomicity. In: Akl, S.G., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '90. ICCI 1990. Lecture Notes in Computer Science, vol 468. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53504-7_72

Download citation

  • DOI: https://doi.org/10.1007/3-540-53504-7_72

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53504-1

  • Online ISBN: 978-3-540-46677-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation