Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

3 results about "Software transactional memory" patented technology

In computer science, software transactional memory (STM) is a concurrency control mechanism analogous to database transactions for controlling access to shared memory in concurrent computing. It is an alternative to lock-based synchronization. STM is a strategy implemented in software, rather than as a hardware component. A transaction in this context occurs when a piece of code executes a series of reads and writes to shared memory. These reads and writes logically occur at a single instant in time; intermediate states are not visible to other (successful) transactions. The idea of providing hardware support for transactions originated in a 1986 paper by Tom Knight. The idea was popularized by Maurice Herlihy and J. Eliot B. Moss. In 1995 Nir Shavit and Dan Touitou extended this idea to software-only transactional memory (STM). Since 2005, STM has been the focus of intense research and support for practical implementations is growing.

Concurrent programming method and device based on software transactional memory

The invention discloses a concurrent programming method and device based on a software transactional memory. Belongs to the technical field of computer programming. According to the concurrent programming method based on the software transactional memory, on the basis of a cache hardware structure supporting exchangeable update perception and transaction processing supporting exchangeable update operation, a sub-transaction serial execution graph is dynamically maintained, and the serializability of sub-transactions is judged at a transaction submission node; the concurrency in the transaction execution process is enhanced; the child transactions and the parent transactions are executed concurrently based on the characteristics of Future asynchronous programming, so that the strong relevance between the execution of the parent transactions and the child transactions is reduced, and the possibility of transaction rollback and the condition of transaction execution failure are reduced; in addition, a plurality of parent transaction submission strategies are provided, and the problem of inconsistent global observation can be avoided through a blocking waiting strategy; the independent submission strategy can improve the transaction execution efficiency and reduce the influence range of transaction rollback.
Owner:NAT UNIV OF DEFENSE TECH

Concurrency Management Model Using Software Transactional Memory, Dynamic Data Race Detection, And / Or Thread-Local Garbage Collection

Techniques for detecting and preventing potential sources of concurrency issues are disclosed. In response to an attempt to modify a shared data structure, the system generates a copy of the shared data structure in a transaction area allocated for performing the modification through a software memory transaction. The system applies the modification to the copy of the shared data structure, and the system subsequently acquires a lock on the shared data structure. After acquiring the lock, the system checks for accesses to the shared data structure that would conflict with applying the modification to shared data structure. If the check does not reveal a conflicting access, the system commits the software memory transaction by updating the shared data structure to match the state of the copy of the shared data structure. If the check does reveal a conflicting access, the system aborts the software memory transaction.
Owner:ORACLE INT CORP

A concurrent programming method and device based on software transaction memory

The present invention discloses a concurrent programming method and device based on software transaction memory. It belongs to the technical field of computer programming. The concurrent programming method based on software transaction memory designed by the present application is based on a high-speed cache hardware structure that supports exchangeable update perception, supports transaction processing of exchangeable update operations, and dynamically maintains the serial execution graph of sub-transactions, judges the serializability of sub-transactions at the transaction commit node, and enhances the concurrency in the transaction execution process; and concurrently executes sub-transactions and parent transactions based on the characteristics of Future asynchronous programming, reduces the strong correlation between the execution of parent and child transactions, reduces the possibility of transaction rollback and the failure of transaction execution; in addition, provides a variety of parent transaction commit strategies, and the blocking waiting strategy can avoid the problem of global observation inconsistency; the independent commit strategy can improve the efficiency of transaction execution and reduce the scope of influence of transaction rollback.
Owner:NAT UNIV OF DEFENSE TECH