License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2017.10
URN: urn:nbn:de:0030-drops-86306
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8630/
Cohen, Nachshon ;
Herlihy, Maurice ;
Petrank, Erez ;
Wald, Elias
The Teleportation Design Pattern for Hardware Transactional Memory
Abstract
We identify a design pattern for concurrent data structures, called teleportation, that uses best- effort hardware transactional memory to speed up certain kinds of legacy concurrent data struc- tures. 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.
BibTeX - Entry
@InProceedings{cohen_et_al:LIPIcs:2018:8630,
author = {Nachshon Cohen and Maurice Herlihy and Erez Petrank and Elias Wald},
title = {{The Teleportation Design Pattern for Hardware Transactional Memory}},
booktitle = {21st International Conference on Principles of Distributed Systems (OPODIS 2017)},
pages = {10:1--10:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-061-3},
ISSN = {1868-8969},
year = {2018},
volume = {95},
editor = {James Aspnes and Alysson Bessani and Pascal Felber and Jo{\~a}o Leit{\~a}o},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8630},
URN = {urn:nbn:de:0030-drops-86306},
doi = {10.4230/LIPIcs.OPODIS.2017.10},
annote = {Keywords: Hardware transactional memory, concurrent data structures}
}
|
Keywords: |
|
Hardware transactional memory, concurrent data structures |
|
Collection: |
|
21st International Conference on Principles of Distributed Systems (OPODIS 2017) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
28.03.2018 |
