Resource lock ownership identification is provided across processes and systems of a clustered computing environment by a method which includes saving by a process, based on a user acquiring a resource lock, a lock information record to a shared data structure of the clustered computing environment. The lock information record includes user identification data identifying the user-owner of the resource lock acquired on a system executing the process. The method also includes referencing, by another process, the lock information record of the shared data structure to ascertain the user identification data identifying the user-owner of the resource lock, and thereby facilitate processing within the clustered computing environment.

The subject matter described herein provides techniques to ensure that queries of a distributed database observe a consistent read of the database without locking or logging. In this regard, next-write timestamps uniquely identify a set of write transactions whose updates can be observed by reads. By publishing the next-write timestamps from within an extendable time lease and tracking a “safe timestamp,” the database queries can be executed without logging read operations or blocking future write transactions, and clients issuing the queries at the “safe timestamp” observe a consistent view of the database as it exists on or before that timestamp. Aspects of this disclosure also provide for extensions, done cheaply and without the need for logging, to the range of timestamps at which read transactions can be executed.

Embodiments of the present disclosure relate to a method, system, and computer program product for block level lock on a data table. According to the method, in response to first transactional processing to be applied on a data table, one or more processors determine that first target data to be accessed during execution of the first transactional processing is comprised in a continuous range of data in the data table. One or more processors determine whether a block lock is available for locking the continuous range of data for the first transactional processing. In accordance with a determination that the block lock is available, one or more processors grant the first transactional processing with the block lock, the block lock being associated with lock information indicating the continuous range of data.

Systems and methods for provisioning a new secondary IdentityIQ instance to an existing IdentityIQ instance are disclosed. In one embodiment, a method may include: receiving a request to provision the new secondary IdentityIQ instance; creating a primary IdentityIQ instance for the existing IdentityIQ instance and the new secondary IdentityIQ instance; aggregating data from the existing IdentityIQ instance to the primary IdentityIQ instance; deploying an event handler to the primary IdentityIQ instance to handle incoming requests for the existing IdentityIQ instance; changing a reconciliation process and an audit process from the existing IdentityIQ instance to the primary IdentityIQ instance thereby changing the existing IdentityIQ instance to the secondary IdentityIQ instance for the primary IdentityIQ instance; deploying the new secondary IdentityIQ instance to the primary IdentityIQ instance; and deploying at least one application to the new secondary IdentityIQ instance based on an operation processed by the new secondary IdentityIQ instance.

According to aspects of the present disclosure, there are provided methods and computer program product for accessing a file-based database, the method comprising receiving, at a first process of a multi-process application, a request from a second process of the multi-process application to perform an operation on a file-based database; in response to receiving the request at the first process, beginning execution of a database access thread to perform the requested operation on the file-based database, and providing, by the first process, a result of the requested operation to the second process, and wherein if the requested operation is a write access to the file-based database, limiting to one a number of threads executing to perform operations on the file-based database while the database access thread to perform the write access is executing.

Embodiments of the present disclosure provide a method, a computer program product and apparatus for processing transactions in a synchronized replication system, wherein the method comprises, at a source site in the synchronized replication system: serializing commits of transactions in the synchronized replication system so that only one of the transactions can be committed at the same time; in response to initiating the commit of the one transaction, generating a log for each of transactions that are ongoing in the synchronized replication system, so as to record impact of all operations of a respective transaction on the synchronized replication system; marking transactions for which the logs have been generated; and completing commits of the marked transactions.

A data object has a lock and a condition indicator associated with it. Based at least partly on detecting a first setting of the condition indicator, a reader stores an indication that the reader has obtained read access to the data object in an element of a readers structure and reads the data object without acquiring the lock. A writer detects the first setting and replaces it with a second setting, indicating that the lock is to be acquired by readers before reading the data object. Prior to performing a write on the data object, the writer verifies that one or more elements of the readers structure have been cleared.

In some implementations, a computer-implemented method includes receiving a state update command. The method further includes, in response to the state update command, sending a command to perform a state update in a first server of a plurality of servers and queueing incoming requests for access to the plurality of servers. The method further includes receiving confirmation from the first server that the state update was successful. The method further includes, after receiving the confirmation, sending a respective command to the plurality of servers to perform the state update and a scheduled update time associated with the state update. The method further includes receiving a respective state update message from a subset of the plurality of servers that the state update was successful and after receiving the state update message, transmitting the queued incoming requests to the subset of the plurality of servers.

Techniques are provided for dependency aware parallel splitting of operations. For example, a count of pending data operations being executed by a first node and replicated in parallel to a second node are tracked. A metadata operation is executed at the first node based upon the count being less than a threshold (e.g., the count being zero). A first list of affected inodes modified by the metadata operation is identified. A dependency of the metadata operation with respect to pending metadata operations replicated to the second node is determined. The metadata operation is dispatched to the second node based upon the dependency indicating that the metadata operation is independent of the pending metadata operations.

In some examples, a system provides a data structure containing an entry to store information for an object for sharing by a plurality of entities. The system allocates the object to a first entity of the plurality of entities based on an atomic access of the entry, the atomic access to update, in one operation, multiple information elements in the entry relating to allocation of the object. The system returns, to the first entity, a handle to the object, the handle based on a value in the entry.