Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3018743.3019035acmconferencesArticle/Chapter ViewAbstractPublication PagesppoppConference Proceedingsconference-collections
poster

POSTER: Reuse, don't Recycle: Transforming Algorithms that Throw Away Descriptors

Published: 26 January 2017 Publication History

Abstract

Lock-free algorithms guarantee progress by having threads help one another. Complex lock-free operations facilitate helping by creating descriptor objects that describe how other threads should help them. In many lock-free algorithms, a new descriptor is allocated for each operation. After an operation completes, its descriptor must be reclaimed by a memory reclamation scheme. Allocating and reclaiming descriptors introduces significant space and time overhead.
We present a transformation for a class of lock-free algorithms that allows each thread to efficiently reuse a single descriptor. Experiments on a variety of workloads show that our transformation yields significant improvements over implementations that reclaim descriptors.

References

[1]
T. Brown. Reclaiming memory for lock-free data structures: There has to be a better way. In phPODC '15, pages 261--270.
[2]
T. Brown, F. Ellen, and E. Ruppert. A general technique for non-blocking trees. In phPPoPP '14, pages 329--342.
[3]
F. Ellen, P. Fatourou, E. Ruppert, and F. van Breugel. Non-blocking binary search trees. In phPODC '10, pages 131--140.
[4]
T. L. Harris, K. Fraser, and I. A. Pratt. A practical multi-word compare-and-swap operation. In phDISC '02, pages 265--279.
[5]
S. V. Howley and J. Jones. A non-blocking internal binary search tree. In phSPAA '12, pages 161--171.
[6]
P. E. McKenney and J. D. Slingwine. Read-copy update: Using execution history to solve concurrency problems. In phParallel and Distributed Computing and Systems, pages 509--518, 1998.
[7]
M. M. Michael. Hazard pointers: Safe memory reclamation for lock-free objects. phIEEE Trans. Parallel Distrib. Syst., 15 (6): 491--504, June 2004.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
PPoPP '17: Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
January 2017
476 pages
ISBN:9781450344937
DOI:10.1145/3018743
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.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 January 2017

Check for updates

Author Tags

  1. concurrent data structures
  2. lock-free
  3. synchronization

Qualifiers

  • Poster

Funding Sources

Conference

PPoPP '17
Sponsor:

Acceptance Rates

PPoPP '17 Paper Acceptance Rate 29 of 132 submissions, 22%;
Overall Acceptance Rate 230 of 1,014 submissions, 23%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)7
  • Downloads (Last 6 weeks)1
Reflects downloads up to 23 Sep 2024

Other Metrics

Citations

Cited By

View all

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media