Patent
Combined pessimistic and optimistic concurrency control
TLDR
In this paper, a transactional memory word is provided for each piece of data, which includes a version number, a reader indicator, and an exclusive writer indicator for concurrency control.Abstract:
Various technologies and techniques are disclosed that improve implementation of concurrency control modes in a transactional memory system. A transactional memory word is provided for each piece of data. The transactional memory word includes a version number, a reader indicator, and an exclusive writer indicator. The transactional memory word is analyzed to determine if the particular concurrency control mode is proper. Using the transactional memory word to help with concurrency control allows multiple combinations of operations to be performed against the same memory location simultaneously and/or from different transactions. For example, a pessimistic read operation and an optimistic read operation can be performed against the same memory location.read more
Citations
More filters
Patent
Shared log-structured multi-version transactional datastore with metadata to enable melding trees
TL;DR: In this article, an ordered and shared log of indexed transaction records represented as multi-version data structures of nodes and node pointers is used for enforcing concurrency control, where each node of a record is assigned a log address.
Patent
Distributed transaction management for database systems with multiversioning
TL;DR: Distributed commit as mentioned in this paper is a distributed transaction management technique that ensures synchronization between participating nodes in a global or distributed database transaction that leverages a commit protocol that uses local clocks at the respective participating nodes.
Patent
Optimistic serializable snapshot isolation
TL;DR: In this paper, a concurrency control technique that ensures isolation among concurrently execution transactions optimistically in a multiversion database by applying two optional tests at the end of a read-write transaction is discussed.
Patent
Parallel nested transactions in transactional memory
TL;DR: In this paper, several technologies and techniques are disclosed for supporting parallel nested transactions in a transactional memory system. But they do not describe how to ensure that the effects of the parallel closed nested transactions are hidden from other transactions outside the parent transaction until the parent transactions commit.
Patent
Increasing Functionality Of A Reader-Writer Lock
TL;DR: In this paper, the authors present a method for accessing a shared memory associated with a reader-writer lock according to a first concurrency mode, dynamically changing from the first concurrent mode to a second concurrent mode, and accessing the shared memory according to the second concurrency modes.
References
More filters
Proceedings ArticleDOI
Transactional memory: architectural support for lock-free data structures
Maurice Herlihy,J. Eliot B. Moss +1 more
TL;DR: Simulation results show that transactional memory matches or outperforms the best known locking techniques for simple benchmarks, even in the absence of priority inversion, convoying, and deadlock.
Proceedings ArticleDOI
McRT-STM: a high performance software transactional memory system for a multi-core runtime
TL;DR: McRT-STM as mentioned in this paper is a software transactional memory (STM) system that is part of McRT, an experimental Multi-Core RunTime (MCRT) implementation that supports nested transactions with partial aborts, conditional signaling within a transaction, and object based conflict detection for C/C++ applications.
Patent
Method and system for managing partitioned data resources
TL;DR: In this paper, the authors define logical domains which are arbitrary and entirely orthogonal to partitions, and define a set of logical domains that can be associated with data objects and their associated fragments.
Patent
Method and apparatus providing optimistic locking of shared computer resources
TL;DR: In this article, a lock data structure for concurrent access to a resource object, such as a database object, is proposed. But the approach is not suitable for the use of a legacy database without requiring burdensome changes to a database table schema.
Journal ArticleDOI
Apologizing versus asking permission: optimistic concurrency control for abstract data types
TL;DR: Several new optimistic concurrency control techniques for objects in decentralized distributed systems are described here, their correctness and optimality properties are proved, and the circumstances under which each is likely to be useful are characterized.