A computer system includes transactional memory to implement a nested transaction. The computer system generates a plurality of speculative identification numbers (IDs), identifies at least one of a software thread executed by a hardware processor and a memory operation performed in accordance with an application code. The computer system assigns at least one speculative cache version to a requested transaction based on a corresponding software thread. The speculative ID of the corresponding software thread identifies the speculative cache version. The computer system also identifies a nested transaction in the memory unit, assigns a cache version to the nested transaction, detects a conflict with the nested transaction, determines a conflicted nesting level of the nested transaction, and determines a cache version corresponding to the conflicted nesting level. The computer system also invalidates the cache version corresponding to the conflicted nesting level.

A digital rights management (DRM) including a transfer of a rights object (RO) to a second user in consideration of requirements of a movement of a rights object of a first user (a terminal, an equipment), charge, etc., by providing a post browsing session when the rights object occupied by the first user is transferred to a second user via a server.

Systems and methods to implement a blockchain sharding architecture that running multiple homogeneous chain in parallel to subdivide the workload of the entire network without requiring a centralized coordinator.

A method for processing tasks in a distributed data processing system includes processing sets of tasks. The method includes maintaining, at a first processing node a number of counters including a working counter indicating a current time interval of the number of time intervals in the distributed data processing system, and a replication counter indicating a time interval of the number of time intervals for which at least one of (1) all tasks associated with that time interval, or (2) all corresponding results associated with that time interval, are replicated at multiple processing nodes of the number of processing nodes. The method includes providing messages from the first processing node to the other processing nodes of the number of processing nodes, the messages including the working counter and the replication counter.

A method for managing data in a distributed data processing system including a number of processing nodes includes storing data units in data stores that are associated with a number of different levels of durability. The method includes maintaining indicators including a first indicator associated with a first durability level and a second indicator associated with a second durability level. The first indicator is maintained to reflect a time interval at which all sets of data units associated with the time interval are stored at the first durability level. The second indicator is maintained to reflect a timer interval at which all sets of data units associated with the time interval are stored at the second durability level. The first and second indicators are used to manage processing of the data units in the distributed data processing system.

A method is provided, comprising: receiving, at a first storage array, a first request to perform an atomic write operation at a specified address in a volume; placing a read-write lock on a first instance of the volume, and executing the atomic write operation on the first instance of the volume; transmitting, to a second storage array, a second request to perform the atomic write operation on a second instance of the volume; and detecting whether an error condition is present that is associated with the second request; when the error condition is present, comparing a first data item that is stored at the specified address in the first instance of the volume with a second data item that is stored at the specified address in the second instance of the volume, and, when the first data item matches the second data item, transmitting an acknowledgment.

A method is provided, comprising: receiving, at a first storage array, a first request to perform an atomic write operation at a specified address in a volume; placing a read-write lock on a first instance of the volume, and executing the atomic write operation on the first instance of the volume; transmitting, to a second storage array, a second request to perform the atomic write operation on a second instance of the volume; and detecting whether an error condition is present that is associated with the second request; when the error condition is present, comparing a first data item that is stored at the specified address in the first instance of the volume with a second data item that is stored at the specified address in the second instance of the volume, and, when the first data item matches the second data item, transmitting an acknowledgment.

A method for managing a distributed data processing system, the method implementing counters to track durability states of data units in the distributed data processing system, wherein the counters are used to manage processing of the data units in the distributed data processing system.

A method for processing state update requests in a distributed data processing system includes processing a set of state update requests associated with a first time interval including maintaining a count of issued state update requests for the set of state update requests, maintaining a count of state updates performed for the first set of state update requests, and updating a state consistency indicator to indicate that state updates associated with all state update requests of the first set of state update requests have been performed in response to determining that the count of state updates performed for the first set of state update requests equals the count of issued state update requests for the first set of state update requests.

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for implementing reactive transaction management. A method includes: receiving, by an application framework, a program that defines a transaction having a plurality of operations to one or more respective transactional resources; generating, by the application framework, a respective sequence of reactive operators for each transactional resource in the transaction; initiating each respective sequence of reactive operators, including: determining, by the application framework using a first thread, that one of the sequences has not completed; in response, relinquishing computing resources of the first thread; receiving an indication that all of the sequences of reactive operators have completed; determining that none of the sequences of reactive operators failed; and in response, committing the operations of the transaction in each of the one or more transactional resources.