Brief announcement: Proust: a design space for highly-concurrent transactional data structures
From MaRDI portal
Publication:5368971
DOI10.1145/3087801.3087866zbMATH Open1380.68141arXiv1702.04866OpenAlexW2737714389MaRDI QIDQ5368971FDOQ5368971
Authors: Thomas Dickerson, Paul Gazzillo, Eric Koskinen, Maurice Herlihy 
Publication date: 11 October 2017
Published in: Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Abstract: Most STM systems are poorly equipped to support libraries of concurrent data structures. One reason is that they typically detect conflicts by tracking transactions' read sets and write sets, an approach that often leads to false conflicts. A second is that existing data structures and libraries often need to be rewritten from scratch to support transactional conflict detection and rollback. This paper introduces Proust, a framework for the design and implementation of transactional data structures. Proust is designed to maximize re-use of existing well-engineered by providing transactional "wrappers" to make existing thread-safe concurrent data structures transactional. Proustian objects are also integrated with an underling STM system, allowing them to take advantage of well-engineered STM conflict detection mechanisms. Proust generalizes and unifies prior approaches such as boosting and predication.
Full work available at URL: https://arxiv.org/abs/1702.04866
Recommendations
This page was built for publication: Brief announcement: Proust: a design space for highly-concurrent transactional data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368971)
