39 results about "Nested transaction" patented technology

Hardware assisted transactional memory system with open nested transactions. Some embodiments described herein implement a system whereby hardware acceleration of transactions can be accomplished by implementing open nested transaction in hardware which respect software locks such that a top level transaction can be implemented in software, and thus not be limited by hardware constraints typical when using hardware transactional memory systems.

A user specifies a threshold trace period and can initiate transaction tracing on one, some or all of the transactions running on a software system. Transactions with an execution time that exceeds the threshold trace period are reported to the user using a graphical user interface that lists transactions exceeding the specified threshold. For each listed transaction, a visualization can be provided that enables the user to immediately understand where time was being spent in the traced transaction.

A computer system with a command shell that supports execution of commands within transactions. The command shell responds to commands that start, complete or undo transactions. To support transactions, the command shell may maintain and provide transaction state information. The command shell may interact with a transaction manager that interfaces with resource managers that process transacted instructions within transacted task modules to commit or roll back transacted instructions from those task modules based on transaction state information maintained by the shell. Parameters associated with commands can control behavior in association with transaction process, including supporting nesting transactions and non-nested transactions and bypassing transacted processing in some instances of a command.

Handling parallelism in transactions. One embodiment includes a method that includes beginning a cache resident transaction. The method further includes encountering a nested structured parallelism construct within the cache resident transaction. A determination is made as to whether the transaction would run faster serially in cache resident mode or faster parallel in software transactional memory mode for the overall transaction. In the software transactional memory mode, cache resident mode is used for one or more hierarchically lower nested transactions. The method further includes continuing the transaction in the mode determined.

For a controller for managing a network including managed forwarding elements that forward data in the network, a method for configuring a set of managed forwarding elements is described. The method generates a first set of flow entries for configuring the set of managed forwarding elements to forward packets as non-first-hop forwarding elements for a logical datapath set. The method generates a second set of flow entries for configuring the set of managed forwarding elements to forward packets as first-hop forwarding elements for the logical datapath set. The method sends the first set of flow entries to the set of managed forwarding elements prior to sending the second set of flow entries to the set of managed forwarding elements.

Transactions are applied against a database on a transaction processing system. A tracking engine identifies an uncompleted transaction to be joined, joins the uncompleted transaction, and collects one or more non-durable attributes of the joined uncompleted transaction. Collected attributes of the joined uncompleted transaction are compared against rules in a rules engine that are applicable to the transaction to determine whether an applicable rule in the rules engine is met. The joined uncompleted transaction is allowed to go forward and be applied against the database of the transaction processing system using a synchronous replication engine when the applicable rule is met, and an asynchronous replication engine when the applicable rule is not met. Alternatively, the joined uncompleted transaction is allowed to go forward using a replication engine that replicates using encryption when the applicable rule is met, or replicates unencrypted when the applicable rule is not met.

A system and method for implementing a common transaction manager interface. A system may implement an application server with a transaction manager module configured to provide a common application interface to a local transaction manager and a global transaction manager. The transaction manager module may be configured to determine if a transaction initiated by an application component should be managed by the local transaction manager or the global transaction manager. The local transaction manger may be configured to create a local transaction object for each transaction managed by the local transaction manager, and the global transaction manger may be configured to create a global transaction object for each transaction managed by the global transaction manager. The local transaction objects and the global transaction objects may provide a common application interface for implementing their respective transactions.

Techniques are provided for performing operations in an electronic file system as nested transactions. According to one aspect of the invention, a command to perform one or more file system operations is received. In response to the command, a plurality of operations, including the one or more file system operations, are performed. Performing the plurality of operations includes: (1) performing a first subset of the plurality of operations as part of a first transaction; and (2) performing a second subset of the plurality of operations as part of a second transaction that is nested in the first transaction.

The present technology proposes techniques for ensuring globally consistent transactions. This technology may allow distributed systems to ensure the causal order of read and write transactions across different partitions of a distributed database. By assigning causally generated timestamps to the transactions based on one or more globally coherent time services, the timestamps can be used to preserve and represent the causal order of the transactions in the distributed system. In this regard, certain transactions may wait for a period of time after choosing a timestamp in order to delay the start of any second transaction that might depend on it. The wait may ensure that the effects of the first transaction are not made visible until its timestamp is guaranteed to be in the past. This may ensure that a consistent snapshot of the distributed database can be determined for any past timestamp.

Embodiments herein provide a fault-handling scheme based on forward recovery for cooperative workflow environments. The fault handling scheme relies on the correct placement of transaction scopes and their associated fault and compensation handlers for maintaining correct application semantics, a fault propagation scheme for forwarding faults to a workflow component that has the corresponding fault handler, and a distributed mechanism for collecting data of completed workflow components to facilitate recovering from faults. The fault handling scheme makes use of control flow messages to facilitate compensation of nested transaction scopes (residing in different components). The workflow components are also modified with additional code for aiding with fault propagation and fault recovery.

The invention discloses a blockchain network method supporting different Token exchange transfer transaction verification. The method comprises the following steps: A creates an exchange nested transaction by using an own blockchain node operation interface, and signs the nested transaction by using an own private key, the A copies a singed character string and sends the signed character string toB through a communication tool; the B sticks the signed character string to a multi-signature transaction operation interface of an own blockchain node, if being correct, the B signs the transactionagain and sends the transaction to a Blockchain network at the same time; and the other nodes in the network receive the nested transaction sent by the B, and firstly read a transaction type, the nested transaction verifies whether the nested transaction structure is correct, whether the two signatures of the nested transaction are legal, and whether the input transaction is legal at first, if so,joins a trading pool, performs hash calculation and broadcasts the transaction to the next node. By adoption of the blockchain network method disclosed by the invention, no smart contract is needed to serve as an intermediary agent, thus being convenient and quick, improving the transaction efficiency, being safe and reliable, and being conducive to promotion.

Embodiments of the present invention address deficiencies of the art in respect to nested transaction rollback and provide a method, system and computer program product for dynamic nest level determination for nested transaction rollback. In an embodiment of the invention, a nested transaction rollback method can be provided. The method can include detecting a violation of a block of memory accessed within a set of nested transactions, retrieving a tentative rollback level for the violation, discarding a speculative state for the block of memory at each level of the set of nested transactions up to and including the tentative rollback level, refining the tentative rollback level to a lower level in the set of nested transactions, and additionally discarding a speculative state for the block of memory at additional levels in the set of nested transactions up to and including the refined rollback level.

The invention discloses a hardware transactional nesting method for supporting rollback of a conditional part. According to the method, a global data set is maintained by each layer of nesting transaction, and the access condition of each layer of transaction to the data is recorded in the set. The method comprises the following steps: if the data set accessed by a conflict layer transaction has no superposition with the data sets of other transactions before the conflict layer transaction, rolling back to the initial position of the conflict layer transaction; and if the conflict layer transaction has the same conflict variable with the data set of the transaction before the conflict layer transaction, rolling back to the initial position of the first appearing transaction with the same conflict variable. The method of the invention reduces the great cost required for rolling back the transaction to the outmost layer in a closed nesting mode, and effectively improves the transactional nesting performance without greatly increasing the complexity of the hardware.

The invention relates to a method for realizing an MPSoC (Multi-Processor System on Chip)-oriented transaction memory. According to the technical scheme, the method comprises the following steps of: 1, partitioning an SPM (Scratch Pad Memory) space and partitioning a nested transaction stack space of which the size is P for a nested transaction specific to an SPM space of which the size is M, wherein if the space occupied by memory operation in each transaction object in the SPM space is s, the quantity n of memory operations which can be stored in the partitioned SPM space is equal to (M-P) / s; 2, executing an MPSoC-oriented transaction object; 3, nesting the MPSoC-oriented transaction object; 4, rolling the MPSoC-oriented transaction object back; and 5, defining an interface of MPSoC-oriented transaction memory operation. The method is suitable for an MPSoC-oriented transaction memory; and by adopting the method, the characteristics of high access speed and low energy consumption of the SPM are fully utilized, the transaction processing speed is increased, power consumption on transaction processing is reduced, and the performance of the transaction memory is enhanced.

Various technologies and techniques are disclosed for supporting parallel nested transactions in a transactional memory system. Releasing a duplicate write lock for rollback is supported. During rollback processing of a parallel nested transaction, a write log entry is encountered that represents a write lock. If the write lock is a duplicate, a global lock is used to synchronize access to a global versioned write lock map. Optimistic read validation is supported. During validation, if a versioned write lock indicates a sibling conflict, consult information to determine if a parallel nested transaction should be doomed. Write lock acquisition is supported. Upon attempting to acquire a write lock for a parallel nested transaction, a transactional memory word is analyzed to determine if the write lock can be obtained. If the transactional memory word indicates a versioned write lock, retrieve a write log entry pointer from a global versioned write lock map.

A method is provided for controlling whether transactions applied against a database go forward or are aborted on a transaction processing system. A tracking engine identifies an uncompleted transaction to be joined, joins the uncompleted transaction, and collects one or more attributes of the joined uncompleted transaction. The collected one or more attributes become available as a result of the joining of the uncompleted transaction. The collected one or more attributes of the joined uncompleted transaction are compared against rules in a rules engine to determine whether the joined uncompleted transaction goes forward or is aborted. Alternatively, the joined uncompleted transaction is automatically modified so that the collected attributes are in compliance with the rules in the rules engine, thereby allowing the joined uncompleted transaction to go forward and be applied against the database of the transaction processing system.

Embodiments herein provide a fault-handling scheme based on forward recovery for cooperative workflow environments. The fault handling scheme relies on the correct placement of transaction scopes and their associated fault and compensation handlers for maintaining correct application semantics, a fault propagation scheme for forwarding faults to a workflow component that has the corresponding fault handler, and a distributed mechanism for collecting data of completed workflow components to facilitate recovering from faults. The fault handling scheme makes use of control flow messages to facilitate compensation of nested transaction scopes (residing in different components). The workflow components are also modified with additional code for aiding with fault propagation and fault recovery.

The invention discloses a method for integrating a native transaction and a logical transaction. The method includes the steps of creating a transaction, starting the transaction, subjecting the transaction to transaction management, submitting the transaction, and rolling back the transaction. Compared with the prior art, the method has the advantages that a logical transaction type and a logical transaction boundary type are applied, a user can start the transaction or directly submit the transaction, execution of submission and rollback of the logical transaction is determined according to the current transaction boundary type, inter-transaction deadlock is solved, and practicality is high.

The present technology proposes techniques for ensuring globally consistent transactions. This technology may allow distributed systems to ensure the causal order of read and write transactions across different partitions of a distributed database. By assigning causally generated timestamps to the transactions based on one or more globally coherent time services, the timestamps can be used to preserve and represent the causal order of the transactions in the distributed system. In this regard, certain transactions may wait for a period of time after choosing a timestamp in order to delay the start of any second transaction that might depend on it. The wait may ensure that the effects of the first transaction are not made visible until its timestamp is guaranteed to be in the past. This may ensure that a consistent snapshot of the distributed database can be determined for any past timestamp.

Aspects of branch prediction are suppressed for branch instructions executing in transactions, of a transactional memory environment, that are re-executions of previously aborted transactions.

Branch prediction is suppressed for branch instructions executing in a transaction of a transactional memory (TM) environment in transactions that are re-executions of previously aborted transactions.

Handling parallelism in transactions. A method includes beginning a cache resident transaction. The method further includes encountering a nested structured parallelism construct within the cache resident transaction. A determination is made as to whether the transaction would run faster serially in cache resident mode or faster parallel in software transactional memory mode for the overall transaction. In the software transactional memory mode, cache resident mode is used for one or more hierarchically lower nested transactions. The method further includes continuing the transaction in the mode determined.

A method, system, and computer program product to solve the problem of consistency in processing when one server performs a transmission transaction and a reception transaction in an in-line processing manner. In a system according to this invention, a local buffer is generated at the time of starting a transmission transaction, and a message is inserted in the local buffer at the time of transmission processing. At the time of commitment of the transmission transaction, after reception transaction processing on all messages in the local buffer, processing for commitment to the data base is performed. Processing for the reception transaction is performed as a nested transaction in the transmission transaction.