iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://unpaywall.org/10.1007/S00446-007-0023-3
Common2 extended to stacks and unbounded concurrency | Distributed Computing Skip to main content
Springer Nature Link
Log in

Common2 extended to stacks and unbounded concurrency

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

This paper extends Common2, the family of objects that implement and are wait-free implementable from 2 consensus objects, in two ways: First, the stack object is shown to be in the family, refuting a conjecture to the contrary [6]. Second, Common2 is investigated in the unbounded concurrency model, whereas until now it was considered only in an n-process model. We show that the fetch-and-add, test-and-set , and stack objects are in Common2 even with respect to this stronger notion of wait-free implementation. Our constructions rely on a wait-free implementation of immediate snapshots in the unbounded concurrency model, which was previously not known to be possible. The introduction of unbounded concurrency to the study of Common2 opens several directions of research: are there objects that have n-process implementations but are not unbounded concurrency implementable? We conjecture that swap is such an object. Additionally, the hope is that a queue impossibility proof, which eludes us in the n-process model, will be easier to establish in the unbounded concurrency model.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Afek, Y., Gafni, E., Tromp, J., Vitányi, P.M.B.: Wait-free TAS. In: Proceedings of WDAG. Lecture Notes in Computer Science, vol. 647, pp. 85–94 (1992)

  2. Afek Y. and Weisberger E. (1999). The instancy of snapshots and commuting objects. J Algorithms 30(1): 68–105

    Article  MATH  MathSciNet  Google Scholar 

  3. Afek, Y., Weisberger, E., Weisman, H.: A completeness theorem for a class of synchronization objects. In: Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 159–170 (1993)

  4. Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming.In: Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 41–51 (1993)

  5. David, M.: A single-enqueuer wait-free queue implementation. In: Proceedings of DISC 2004. Lecture Notes in Computer Science, vol. 3274, pp. 132–143 (2004)

  6. David, M.: Alex Brodsky and faith Ellen Fich. Restricted stack implementations. In: Proceedings of DISC 2005. Lecture Notes in Computer Science, vol. 3724, pp. 137–151 (2005)

  7. Gafni, E.: A simple algorithmic characterization of uniform solvability. In: Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), pp. 228–237 (2002)

  8. Gafni, E., Merritt, M., Taubenfeld, G.: The concurrency hierarchy, and algorithms for unbounded concurrency. In: Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing (PODC 2001) (2001)

  9. Hendler, D., Shavit, N., Yerushalmi, L.: A scalable lock-free stack algorithm. In: Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2004), pp. 206–215 (2004)

  10. Herlihy, M.: Impossibility results for asynchronous PRAM. In: Proceedings of the 2nd Annual Symposium on Parallel Algorithms and Architectures (SPAA), pp. 327–336 (1991)

  11. Herlihy M. (1991). Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1): 124–149

    Article  Google Scholar 

  12. Herlihy M. and Shavit N. (1999). The topological structure of asynchronous computability. J. ACM 46(6): 858–923

    Article  MATH  MathSciNet  Google Scholar 

  13. Herlihy M. and Wing J. (1990). Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3): 463–492

    Article  Google Scholar 

  14. Li, Z.: Non-blocking implementations of queues in asynchronous distributed shared-memory systems. Master’s thesis, Department of Computer Science, University of Toronto (2001)

  15. Scott McCrickard, D.A.: Study of wait-free hierarchies in concurrent systems. Technical report GIT-CC-94-94

  16. Weisman, H.: Implementing shared memory overwriting objects. Master’s thesis, School of Computer Science, Tel-Aviv University

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Tel-Aviv University, Tel-Aviv, Israel

    Yehuda Afek & Adam Morrison

  2. Computer Science Department, University of California, Los Angeles, USA

    Eli Gafni

Authors
  1. Yehuda Afek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eli Gafni
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Adam Morrison
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yehuda Afek.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Afek, Y., Gafni, E. & Morrison, A. Common2 extended to stacks and unbounded concurrency. Distrib. Comput. 20, 239–252 (2007). https://doi.org/10.1007/s00446-007-0023-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-007-0023-3

Keywords

Search

Navigation