Skip to main content
SpringerLink
Log in

A Thrifty Universal Construction

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

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

Included in the following conference series:

  • 559 Accesses

Abstract

A universal construction is an algorithm which transforms any sequential implementation of an object into a concurrent implementation of that same object in a linearizable and wait-free manner. Such constructions require underlying low-level universal shared objects such as compare-and-swap and load-linked/store-conditional.

In this paper, we present the first universal construction that (a) uses exactly one compare-and-swap object and (b) has time complexity (number of accesses to low-level shared objects) and memory complexity (size of low-level shared objects) that are both independent of the size of the high-level object to be implemented.

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., Dauber, D., Touitou, D.: Wait-free made fast. In: Proceedings of the Twenty-seventh Annual ACM Symposium on Theory of Computing. pp. 538–547. ACM (1995)

    Google Scholar 

  2. Alistarh, D., Censor-Hillel, K., Shavit, N.: Are lock-free concurrent algorithms practically wait-free? In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing. pp. 714–723. ACM (2014)

    Google Scholar 

  3. Anderson, J.H., Moir, M.: Universal constructions for large objects. IEEE Trans. Parallel Distrib. Syst. 10(12), 1317–1332 (1999)

    Article  Google Scholar 

  4. Barnes, G.: A method for implementing lock-free shared-data structures. In: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures. pp. 261–270. ACM (1993)

    Google Scholar 

  5. Fatourou, P., Kallimanis, N.D.: The redblue adaptive universal constructions. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 127–141. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  6. Fatourou, P., Kallimanis, N.D.: A highly-efficient wait-free universal construction. In: Proceedings of the Twenty-third Annual ACM Symposium on Parallelism in Algorithms and Architectures. pp. 325–334. ACM (2011)

    Google Scholar 

  7. Fraser, K.: Practical lock-freedom. Ph.D. thesis, University of Cambridge (2004)

    Google Scholar 

  8. Hendler, D., Incze, I., Shavit, N., Tzafrir, M.: Flat combining and the synchronization-parallelism tradeoff. In: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures. pp. 355–364. ACM (2010)

    Google Scholar 

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

    Article  Google Scholar 

  10. Herlihy, M.: A methodology for implementing highly concurrent data objects. ACM Trans. Program. Lang. Syst. (TOPLAS) 15(5), 745–770 (1993)

    Article  Google Scholar 

  11. Herlihy, M., Shavit, N.: On the nature of progress. In: Fernàndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 313–328. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  12. Herlihy, M.P., Wing, J.M.: Axioms for concurrent objects. In: Proceedings of the 14th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. pp. 13–26. ACM (1987)

    Google Scholar 

  13. Michael, M.M.: High performance dynamic lock-free hash tables and list-based sets. In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures. pp. 73–82. ACM (2002)

    Google Scholar 

  14. Moir, M.: Practical implementations of non-blocking synchronization primitives. In: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing. pp. 219–228. ACM (1997)

    Google Scholar 

  15. Valois, J.D.: Lock-free linked lists using compare-and-swap. In: Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing. pp. 214–222. ACM (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland

    Wang Cheng & Rachid Guerraoui

Authors
  1. Wang Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rachid Guerraoui
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wang Cheng .

Editor information

Editors and Affiliations

  1. Université Paris Diderot, Paris Cedex 13, France

    Ahmed Bouajjani

  2. Université Paris Diderot, Paris Cedex 13, France

    Hugues Fauconnier

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Cheng, W., Guerraoui, R. (2015). A Thrifty Universal Construction. In: Bouajjani, A., Fauconnier, H. (eds) Networked Systems . NETYS 2015. Lecture Notes in Computer Science(), vol 9466. Springer, Cham. https://doi.org/10.1007/978-3-319-26850-7_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26850-7_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26849-1

  • Online ISBN: 978-3-319-26850-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation