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

skip to main content
poster
Public Access

POSTER: State Teleportation via Hardware Transactional Memory

Published: 26 January 2017 Publication History

Abstract

State teleportation is a new technique for exploiting hardware transactional memory (HTM) to improve existing synchronization and memory management schemes for highly-concurrent data structures. When applied to fine-grained locking, a thread holding the lock for a node launches a hardware transaction that traverses multiple successor nodes, acquires the lock for the last node reached, and releases the lock on the starting node, skipping lock acquisitions for intermediate nodes. When applied to lock-free data structures, a thread visiting a node protected by a hazard pointer launches a hardware transaction that traverses multiple successor nodes, and publishes the hazard pointer only for the last node reached, skipping the memory barriers needed to publish intermediate hazard pointers. Experimental results show that these applications of state teleportation can substantially increase the performance of both lock-based and lock-free data structures.

References

[1]
Bayer, R., and Schkolnick, M. Concurrency of operations on b-trees. Acta Informatica (1977).
[2]
Harris, T. A pragmatic implementation of non-blocking linked-lists. In DISC'01 (2001).
[3]
Heller, S., Herlihy, M., Luchangco, V., Moir, M., III, W. N. S., andShavit, N. A lazy concurrent list-based set algorithm. In OPODIS'05.
[4]
Herlihy, M., and Moss, J. E. B. Transactional memory: architectural support for lock-free data structures. In ISCA'93.
[5]
Intel Corporation. Transactional Synchronization in Haswell, 2012.
[6]
Michael, M. M. Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Trans. Parallel Distrib. Syst. (2004).

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices
ACM SIGPLAN Notices  Volume 52, Issue 8
PPoPP '17
August 2017
442 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/3155284
Issue’s Table of Contents
  • 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.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 January 2017
Published in SIGPLAN Volume 52, Issue 8

Check for updates

Author Tags

  1. concurrent data structures
  2. hand-over-hand
  3. hazard pointers
  4. lock-free
  5. memory management
  6. non-blocking
  7. teleportation

Qualifiers

  • Poster

Funding Sources

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 591
    Total Downloads
  • Downloads (Last 12 months)74
  • Downloads (Last 6 weeks)15
Reflects downloads up to 23 Sep 2024

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media