Patent
Handling falsely doomed parents of nested transactions
Reads0
Chats0
TLDR
In this article, various technologies and techniques are disclosed for detecting falsely doomed parent transactions of nested children in transactional memory systems, and a release count is tracked each time that a write lock is released due to rollback for a given nested transaction.Abstract:
[029] Various technologies and techniques are disclosed for detecting falsely doomed parent transactions of nested children in transactional memory systems. When rolling back nested transactions, a release count is tracked each time that a write lock is released due to rollback for a given nested transaction. For example, a write abort compensation map can be used to track the release count for each nested transaction. The number of times the nested transactions releases a write lock is recorded in their respective write abort compensation map. The release counts can be used during a validation of a parent transaction to determine if a failed optimistic read is really valid. If an aggregated release count for the nested children transactions accounts for the difference in version numbers exactly, then the optimistic read is valid.read more
Citations
More filters
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
Non-deterministic memory protocol
TL;DR: The present disclosure includes apparatuses and methods related to a non-deterministic memory protocol as mentioned in this paper, where the memory device can be a nonvolatile dual in-line memory module (NVDIMM) device.
Patent
Configuration replication in a search head cluster
TL;DR: In this paper, a cluster of search heads may be synchronized such that the search heads operate to receive the configuration or knowledge object customizations from one or more clients via a user interface.
Patent
Composition of locks in software transactional memory
Sukhdeep S. Sodhi,Yosseff Levanoni,David Detlefs,Lingli Zhang,Weirong Zhu,Dana Groff,Michael M. Magruder,II Charles David Callahan +7 more
TL;DR: In this article, a software transactional memory (STM) system allows the composition of traditional lock based synchronization with transactions in STM code, and the STM system acquires each traditional lock the first time that a corresponding traditional lock acquire is encountered inside a transaction and defers all traditional lock releases until a top level transaction in a transaction nest commits or aborts.
Patent
Action framework in software transactional memory
TL;DR: In this paper, the authors propose a lightweight key-based action framework for software transactional memory systems, which includes a set of unified application programming interfaces (APIs) exposed by an STM library that allow clients to implement actions that can be registered, queried, and updated using specific keys by transactions or transaction nests.
References
More filters
Journal ArticleDOI
Compiler and runtime support for efficient software transactional memory
Ali-Reza Adl-Tabatabai,Brian T. Lewis,Vijay Menon,Brian R. Murphy,Bratin Saha,Tatiana Shpeisman +5 more
TL;DR: A high-performance software transactional memory system (STM) integrated into a managed runtime environment is presented and the JIT compiler is the first to optimize the overheads of STM, and novel techniques for enabling JIT optimizations on STM operations are shown.
Patent
Method, System, and Program for Merging Log Entries From Multiple Recovery Log Files
Serge Bourbonnais,Elizabeth B. Hamel,Bruce G. Lindsay,Chengfei Liu,Jens Stankiewitz,Tuong Chanh Truong +5 more
TL;DR: In this article, a method, system, and program for merging independent log entries in a multiple node shared nothing DBMS is presented, where log entries from multiple log entries are combined to form a single log entry sequence.
Patent
Distributed multi-version commitment ordering protocols for guaranteeing serializability during transaction processing
TL;DR: In this article, the read-write transactions are serialized by maintaining and referencing a graph of conflicts among readwrite transactions, and read-only transactions areserialized by a timestamp mechanism for selection of the snapshots to be read.
Proceedings ArticleDOI
Open nesting in software transactional memory
Yang Ni,Vijay Menon,Ali-Reza Adl-Tabatabai,Antony L. Hosking,Richard L. Hudson,J. Eliot B. Moss,Bratin Saha,Tatiana Shpeisman +7 more
TL;DR: New language constructs to support open nesting in Java are described, and it is demonstrated how these constructs can be mapped efficiently to existing STM data structures, demonstrating how open nesting can enhance application scalability.
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.
Related Papers (5)
Mechanism for executing nested transactions in an execution environment supporting flat transactions only
Joerg Bischof,Keith Whittingham +1 more