Vincent Gramoli
Petr Kuznetsov
ABSTRACT
No abstract available.
- R. Bayer and M. Schkolnick. Readings in database systems. pages 129--139, San Francisco, CA, USA, 1988. Morgan Kaufmann Publishers Inc. Google Scholar
Digital Library
- V. Gramoli, D. Harmanci, and P. Felber. On the input acceptance of transactional memory. Parallel Processing Letters, 20(1):31--50, 2010.Google ScholarCross Ref
- V. Gramoli, P. Kuznetsov, and S. Ravi. From sequential to concurrent: Correctness and relative efficiency. CoRR, abs/1203.4751, 2012.Google Scholar
- M. Herlihy. SXM: C# software transactional memory, 2005. www.cs.brown.edu/mph/SXM/README.doc.Google Scholar
- M. Herlihy, V. Luchangco, M. Moir, and W. N. Scherer, III. Software transactional memory for dynamic-sized data structures. In PODC, pages 92--101, 2003. Google ScholarDigital Library
- M. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12(3):463--492, 1990. Google ScholarDigital Library
- D. Perelman, R. Fan, and I. Keidar. On maintaining multiple versions in STM. In PODC, pages 16--25, 2010. Google ScholarDigital Library
Index Terms
- Brief announcement: From sequential to concurrent: correctness and relative efficiency
Recommendations
Brief Announcement: Extending Transactional Memory with Atomic Deferral
SPAA '17: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and ArchitecturesAtomic deferral is a language-level mechanism for transactional memory (TM) that enables programmers to move output and long-running operations out of a transaction's body without sacrificing serializability: the deferred operation appears to execute as ...
Brief announcement: on enhancing concurrency in distributed transactional memory
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computingDistributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violating correctness. To reduce unnecessary aborts and increase concurrency, we ...
Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures
PODC '17: Proceedings of the ACM Symposium on Principles of Distributed ComputingMost 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 ...
Comments