The teleportation design pattern for hardware transactional memory

Nachshon Cohen, Maurice Herlihy, Erez Petrank, Elias Wald

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We identify a design pattern for concurrent data structures, called teleportation, that uses besteffort hardware transactional memory to speed up certain kinds of legacy concurrent data structures. Teleportation unifies and explains several existing data structure designs, and it serves as the basis for novel approaches to reducing the memory traffic associated with fine-grained locking, and with hazard pointer management for memory reclamation.

Original languageEnglish
Title of host publication21st International Conference on Principles of Distributed Systems, OPODIS 2017
EditorsJames Aspnes, Joao Leitao, Alysson Bessani, Pascal Felber
ISBN (Electronic)9783959770613
DOIs
StatePublished - 1 Mar 2018
Event21st International Conference on Principles of Distributed Systems, OPODIS 2017 - Lisboa, Portugal
Duration: 18 Dec 201720 Dec 2017

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume95

Conference

Conference21st International Conference on Principles of Distributed Systems, OPODIS 2017
Country/TerritoryPortugal
CityLisboa
Period18/12/1720/12/17

Keywords

  • Concurrent data structures
  • Hardware transactional memory

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'The teleportation design pattern for hardware transactional memory'. Together they form a unique fingerprint.

Cite this