An efficient scheduler for closed nested transactions that satisfies all-reads-consistency and non-interference

Springer Berlin/Heidelberg
Sathya Peri Krishnamurthy Vidyasankar
Abstract. A generally agreed upon requirement for correctness of concurrent executions in Transactional Memory systems is that all transactions including the aborted ones read consistent values. We denote this as all-reads-consistency. Opacity is a correctness criterion that satisfies the above requirement. A relevant property, which we call as non-interference, is that an aborted transaction should not affect the consistency of the transactions that are executed subsequently. This property is desirable in general and critical for closed nested ...