Transactions are Back—but How Different They Are? Relating STM and Databases Consistency Conditions (Preliminary Version)
نویسندگان
چکیده
We describe several database consistency conditions that restrict ongoing transactions (which might later be aborted), and relate them to known consistency conditions for transactional memory. In particular, we show that rigorousness is strictly stronger than opacity, but strictness is incomparable to opacity. The same relationships also hold for virtual world consistency. We also show that all non-eager STMs are strict.
منابع مشابه
View Transactions and the Relaxation of Consistency Checks in Software Transactional Memory
We present view transactions, a model for relaxed consistency checks in software transactional memory (STM). View transactions always operate on a consistent snapshot of memory but may commit in a different snapshot. They are therefore simpler to reason about, provide opacity and maintain composability. In addition, view transactions avoid many of the overheads associated with previous approach...
متن کاملA Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
The aim of a Software Transactional Memory (STM) is to discharge the programmers from the management of synchronization in multiprocess programs that access concurrent objects. To that end, a STM system provides the programmer with the concept of a transaction. The job of the programmer is to decompose each sequential process the application is made up of into transactions. A transaction is a p...
متن کاملHybrid TM Using NOrec STM
Transactional memory (TM) aims to simplify parallel programming by providing serializable memory transactions as an extension to the system’s memory model. In the context of increasing numbers of on-chip processor cores, Sun’s Rock processor [3] and AMD’s proposed Advanced Synchronization Facility (ASF) [1] suggest that commercial support for best-effort hardware TM (HTM) may finally be forthco...
متن کاملA TimeStamp Based Multi-version STM Algorithm
Software Transactional Memory Systems (STM) are a promising alternative for concurrency control in shared memory systems. Multiversion STM systems maintain multiple versions for each t-object. The advantage of storing multiple versions is that it facilitates successful execution of higher number of read operations than otherwise. Multi-Version permissiveness (mv-permissiveness) is a progress co...
متن کاملMultiversion Conflict Notion for Transactional Memory Systems
In recent years, Software Transactional Memory systems (STMs) have garnered significant interest as an elegant alternative for addressing concurrency issues in memory. STM systems take optimistic approach. Multiple transactions are allowed to execute concurrently. On completion, each transaction is validated and if any inconsistency is observed it is aborted. Otherwise it is allowed to commit. ...
متن کامل