abstract

Brief Announcement: Stamp-it, a more Thread-efficient, Concurrent Memory Reclamation Scheme in the C++ Memory Model

Authors:

Manuel Pöter,

Jesper Larsson TräffAuthors Info & Claims

SPAA '18: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures

Pages 355 - 358

https://doi.org/10.1145/3210377.3210661

Published: 11 July 2018 Publication History

Get Access

Abstract

We present Stamp-it, a new, general, portable, lock-less concurrent memory reclamation scheme with amortized, constant-time (thread-count independent) reclamation overhead. Stamp-it has been implemented and proved correct in the C++ memory model using as weak memory-consistency assumptions as possible. We have (re)implemented six other comparable reclamation schemes. By a detailed performance comparison, we show that Stamp-it performs favorably, sometimes better, but at least as good as these other schemes while being able to reclaim free memory nodes earlier.

References

[1]

Trevor Alexander Brown. 2015. Reclaiming Memory for Lock-Free Data Structures: There Has to Be a Better Way. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC). ACM, 261--270.

Digital Library

Google Scholar

[2]

Keir Fraser. 2004. Practical lock-freedom. Ph.D. Dissertation. University of Cambridge Computer Laboratory.

Google Scholar

[3]

Thomas E. Hart, Paul E. McKenney, Angela Demke Brown, and Jonathan Walpole. 2007. Performance of Memory Reclamation for Lockless Synchronization. J. Parallel and Distrib. Comput. 67, 12 (2007), 1270--1285.

Digital Library

Google Scholar

[4]

Maged M. Michael. 2004. Hazard Pointers: Safe Memory Reclamation for LockFree Objects. IEEE Transactions on Parallel and Distributed Systems 15, 6 (2004), 491--504.

Digital Library

Google Scholar

[5]

Manuel Pöter. 2018. Effective Memory Reclamation for Lock-Free Data Structures in C++. Master's thesis. TU Wien, Vienna, Austria.

Google Scholar

[6]

Manuel Pöter and Jesper Larsson Träff. 2017. A new and five older Concurrent Memory Reclamation Schemes in Comparison (Stamp-it). (2017). arXiv:1712.06134.

Google Scholar

[7]

Manuel Pöter and Jesper Larsson Träff. 2018. POSTER: Stamp-it, Amortized Constant-time Memory Reclamation in Comparison to five other Schemes. In 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP). ACM, 413--414.

Digital Library

Google Scholar

[8]

Manuel Pöter and Jesper Larsson Träff. 2018. Stamp-it: A more Thread-efficient, Concurrent Memory Reclamation Scheme in the C++ Memory Model. (2018).

Google Scholar

[9]

Arch D. Robison. 2013. Policy-Based Design for Safe Destruction in Concurrent Containers. C++ standards committee paper, http://www.open-std.org/jtc1/sc22/ wg21/docs/papers/2013/n3712.pdf. (2013).

Google Scholar

[10]

Håkan Sundell and Philippas Tsigas. 2008. Lock-free deques and doubly linked lists. J. Parallel and Distrib. Comput. 68, 7 (2008), 1008--1020.

Digital Library

Google Scholar

[11]

John D. Valois. 1995. Lock-Free Data Structures. Ph.D. Dissertation. Rensselaer Polytechnic Institute.

Digital Library

Google Scholar

Cited By

View all

Nikolaev RRavindran B(2024)A Family of Fast and Memory Efficient Lock- and Wait-Free ReclamationProceedings of the ACM on Programming Languages10.1145/36588518:PLDI(2174-2198)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3658851
Kim JJung JKang JAgrawal KPetrank E(2024)Expediting Hazard Pointers with Bounded RCU Critical SectionsProceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3659941(1-13)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3659941
Nikolaev RRavindran BFreund SYahav E(2021)Snapshot-free, transparent, and robust memory reclamation for lock-free data structuresProceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation10.1145/3453483.3454090(987-1002)Online publication date: 19-Jun-2021
https://dl.acm.org/doi/10.1145/3453483.3454090
Show More Cited By

Index Terms

Brief Announcement: Stamp-it, a more Thread-efficient, Concurrent Memory Reclamation Scheme in the C++ Memory Model
1. Computing methodologies
  1. Parallel computing methodologies
    1. Parallel algorithms
      1. Shared memory algorithms

Recommendations

Brief Announcement: Hardware Transactional Persistent Memory
SPAA '18: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures

This paper addresses the problem of creating durable transactions in byte-addressable Non-Volatile Memory or Persistent Memory (PM) when using Hardware Transactional Memory (HTM)-based concurrency control. It shows how HTM transactions can be ordered ...
Brief Announcement: Hardware Transactional Storage Class Memory
SPAA '17: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures

Emerging persistent memory technologies (generically referred to as Storage Class Memory or SCM) hold tremendous promise for accelerating popular data-management applications like in-memory databases. However, programmers now need to deal with ensuring ...
Brief announcement: NUMA-aware transactional memory
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Transactional Memory (TM) research has focused on multi-core processors; limited research has been aimed at the clusters, leaving the area of NUMA (Non-Uniform Memory Access) system unexplored. The NUMA system's memory is physically distributed which ...

Comments

Information & Contributors

Information

Published In

SPAA '18: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures

July 2018

437 pages

ISBN:9781450357999

DOI:10.1145/3210377

General Chair:
Christian Scheideler
University of Paderborn, Germany
,
Program Chair:
Jeremy Fineman
Georgetown University, USA

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 July 2018

Check for updates

Qualifiers

Abstract

Conference

SPAA '18

Sponsor:

SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures

July 16 - 18, 2018

Vienna, Austria

Acceptance Rates

SPAA '18 Paper Acceptance Rate 36 of 120 submissions, 30%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
92
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Nikolaev RRavindran B(2024)A Family of Fast and Memory Efficient Lock- and Wait-Free ReclamationProceedings of the ACM on Programming Languages10.1145/36588518:PLDI(2174-2198)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3658851
Kim JJung JKang JAgrawal KPetrank E(2024)Expediting Hazard Pointers with Bounded RCU Critical SectionsProceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3659941(1-13)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3659941
Nikolaev RRavindran BFreund SYahav E(2021)Snapshot-free, transparent, and robust memory reclamation for lock-free data structuresProceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation10.1145/3453483.3454090(987-1002)Online publication date: 19-Jun-2021
https://dl.acm.org/doi/10.1145/3453483.3454090
Nikolaev RRavindran BGupta RShen X(2020)Universal wait-free memory reclamationProceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3332466.3374540(130-143)Online publication date: 19-Feb-2020
https://dl.acm.org/doi/10.1145/3332466.3374540

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Brief Announcement: Hardware Transactional Persistent Memory

Brief Announcement: Hardware Transactional Storage Class Memory

Brief announcement: NUMA-aware transactional memory

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations