Read Invisibility, Virtual World Consistency and Probabilistic Permissiveness are Compatible
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 244-257
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Read Invisibility, Virtual World Consistency and Probabilistic Permissiveness are CompatibleLecture Notes in Computer Science, 2011
- Transactions are back---but are they the same?ACM SIGACT News, 2008
- Distributed computing and the multicore revolutionACM SIGACT News, 2008
- Permissiveness in Transactional Memories2008
- Provable STM Properties: Leveraging Clock and Locks to Favor Commit and Early AbortLecture Notes in Computer Science, 2008
- Transactional Memory: An OverviewIEEE Micro, 2007
- Transactional Locking II2006
- Transactional memory1993
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- Formal Aspects of Serializability in Database Concurrency ControlIEEE Transactions on Software Engineering, 1979