Skip to main content
SpringerLink
Log in

On Helping and Stacks

  • Conference paper
  • First Online:
Networked Systems (NETYS 2018)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 11028))

Included in the following conference series:

  • 444 Accesses

Abstract

A concurrent algorithm exhibits helping when one process performs work on behalf of other processes. More formally, helping is observed when the order of some operation in a linearization is fixed by a step of another process. In this paper, we show that no wait-free linearizable implementation of a stack using read, write, compare&swap and fetch&add operations can be help-free, correcting a mistake in an earlier proof by Censor-Hillel et al.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Afek, Y., Gafni, E., Morrison, A.: Common2 extended to stacks and unbounded concurrency. Distrib. Comput. 20(4), 239–252 (2007)

    Article  Google Scholar 

  2. Afek, Y., Weisberger, E., Weisman, H.: A completeness theorem for a class of synchronization objects. In: PODC, pp. 159–170 (1993)

    Google Scholar 

  3. Arbel-Raviv, M., Brown, T.: Reuse, don’t recycle: transforming lock-free algorithms that throw away descriptors. In: DISC, vol. 91, pp. 4:1–4:16 (2017)

    Google Scholar 

  4. Attiya, H., Castañeda, A., Hendler, D.: Nontrivial and universal helping for wait-free queues and stacks. In: OPODIS, vol. 46 (2016)

    Google Scholar 

  5. Censor-Hillel, K., Petrank, E., Timnat, S.: Help! In: PODC, pp. 241–250 (2015)

    Google Scholar 

  6. Fatourou, P., Kallimanis, N.D.: A highly-efficient wait-free universal construction. In: SPAA, pp. 325–334. ACM (2011)

    Google Scholar 

  7. Feldman, S., Laborde, P., Dechev, D.: A wait-free multi-word compare-and-swap operation. IJPP 43(4), 572–596 (2015)

    Google Scholar 

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

    Article  Google Scholar 

  9. Howley, S.V., Jones, J.: A non-blocking internal binary search tree. In: SPAA, pp. 161–171. ACM (2012)

    Google Scholar 

  10. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, Burlington (1996)

    MATH  Google Scholar 

  11. Michael, M.M.: High performance dynamic lock-free hash tables and list-based sets. In: SPAA, pp. 73–82. ACM (2002)

    Google Scholar 

  12. Natarajan, A., Mittal, N.: Fast concurrent lock-free binary search trees. In: ACM SIGPLAN Notices, vol. 49, pp. 317–328. ACM (2014)

    Google Scholar 

  13. Peng, Y., Hao, Z.: FA-Stack: a fast array-based stack with wait-free progress guarantee. IEEE Trans. Parallel Distrib. Syst. (4), 843–857 (2018)

    Google Scholar 

  14. Timnat, S., Braginsky, A., Kogan, A., Petrank, E.: Wait-free linked-lists. In: Baldoni, R., Flocchini, P., Binoy, R. (eds.) OPODIS 2012. LNCS, vol. 7702, pp. 330–344. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-35476-2_23

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ITMO University, Saint Petersburg, Russia

    Vitaly Aksenov & Anatoly Shalyto

  2. Inria Paris, Paris, France

    Vitaly Aksenov

  3. LTCI, Télécom ParisTech, Université Paris-Saclay, Paris, France

    Petr Kuznetsov

Authors
  1. Vitaly Aksenov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petr Kuznetsov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anatoly Shalyto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vitaly Aksenov .

Editor information

Editors and Affiliations

  1. Universität Freiburg, Freiburg, Germany

    Andreas Podelski

  2. University of Rennes 1, Rennes, France

    François Taïani

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Aksenov, V., Kuznetsov, P., Shalyto, A. (2019). On Helping and Stacks. In: Podelski, A., Taïani, F. (eds) Networked Systems. NETYS 2018. Lecture Notes in Computer Science(), vol 11028. Springer, Cham. https://doi.org/10.1007/978-3-030-05529-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-05529-5_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-05528-8

  • Online ISBN: 978-3-030-05529-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation