A method for managing data includes obtaining, by a management module, a workload generation request, wherein the workload generation request specifies a plurality of resource devices, identifying available resource devices in a resource device pool based on the plurality of resource devices, performing a latency analysis on the available resource devices to obtain a plurality of resource device combinations and a total latency cost of each resource device combination, and selecting a resource device combination of the plurality of resource device combinations based on the total latency cost of each resource device combination, wherein the resource device combination comprises a second plurality of resource devices and wherein each of the second plurality of resource devices is one of the plurality of resource devices.

A computer-implemented method may comprise receiving proposals to mutate a data stored in a distributed and replicated file system coupled to a network, the distributed and replicated data system comprising a plurality of nodes, each comprising a server. A metadata service maintains and updates a replica of a namespace of the distributed and replicated file system and coordinates updates to the data by generating an ordered set of agreements corresponding to the received proposals, the ordered set of agreements specifying an order in which the nodes are to mutate data stored in data nodes and cause corresponding changes to the state of the namespace. For each agreement in the generated ordered set of agreements, a corresponding writers list may be provided that comprises an ordered list of nodes to execute the agreement and make corresponding changes to the namespace. The ordered set of agreements may then be sent to the plurality of nodes along with, for each agreement in the ordered set of agreements, the corresponding writers list or a pre-generated index thereto and each of the plurality of nodes may be configured to only execute agreements for which it is a first-listed node on the received writers list.

Technologies are described providing adaptive query routing in a replicated database environment. The technologies can be used with a variety of replication protocols. Prepared statements, such as for queries, from a database client can be routed to a source node, or a source node and available replica nodes, when a replica node becomes unavailable. When a replica node becomes available again, a prepared statement can be updated to indicate that the updated prepared statement can be executed at nodes including the replica node that is available again. Prepared statement routing can also be used when a portion of replicated data becomes unavailable at a replica node, but a portion of replicated data remains available.

Each redundancy group is constituted by one active program (storage control software of the active program) and N standby programs (N is an integer of two or more). Each of the N standby programs is associated with a priority to be determined as a failover (FO) destination. In the same redundancy group, FO is performed from the active program to the standby program based on the priority. For the plurality of pieces of storage control software including the active programs and the standby programs that change to be active by FO in the plurality of redundancy groups arranged in the same node, standby storage control software that can set each of the programs as a FO destination are arranged in different nodes.

A computing device for configuring a redundant system includes: a detection unit configured to detect another computing device newly added to the redundant system during operation of the computing device; and a construction processing unit configured to execute construction processing for constructing a redundant configuration with the other computing device. The construction processing unit includes a first transmission unit for identifying construction start state information, and transmitting the construction start state information to the other computing device, and a second transmission unit for repeatedly performing identification of a change difference that arises in the state information as a result of computing processing of the computing device performed after identifying the construction start state information, from a time when the construction start state information was identified or a time when a previous timing was reached, and transmission of the change difference to the another computing device.

A resource matching technique between a primary site and one or more secondary sites accommodates a configuration update of a virtual machine (VM) in a disaster recovery (DR) environment. The resource matching technique determines whether a proposed resource configuration update or change to a primary VM running at the primary site is permissible on a secondary VM configured for failover operation at a secondary site in the event of failure to the primary VM. The technique continuously monitors the availability of resources at each secondary site and enables negotiation between the primary and secondary sites of the proposed configuration change based on corresponding indications resource availability. The resources may include generic resources (e.g., memory, storage capacity and CPU processing capacity) and specialized resources (e.g., GPU types and/or models).

A computer-implemented method of continuous restore for containerized applications includes initiating a continuous restore process for a containerized application having an application template and application data, where the containerized application executes on a first cluster. A backup plan for the containerized application is generated. A persistent volume containing the application data in the first cluster is identified and some of the application data is moved from the persistent volume to a backup target based on the backup plan schedule. The backup plan is received at a data synch process executing on a second cluster. A persistent volume is created on the second cluster. Some of the application data is moved from the backup target to the created persistent volume on the second cluster based on the backup plan schedule. The containerized application is recovered at the second cluster based on some of the application data moved to the persistent volume on the second cluster by the data synch process such that the recovered containerized application is operational at the most recent backup point-of-time of the backup plan schedule.

Technologies are described providing adaptive query routing in a replicated database environment. The technologies can be used with a variety of replication protocols. Prepared statements, such as for queries, from a database client can be routed to a source node, or a source node and available replica nodes, when a replica node becomes unavailable. When a replica node becomes available again, a prepared statement can be updated to indicate that the updated prepared statement can be executed at nodes including the replica node that is available again. Prepared statement routing can also be used when a portion of replicated data becomes unavailable at a replica node, but a portion of replicated data remains available.

Replicated instances in a distributed computing environment provide for automatic failover and recovery. A component monitors the status of event processors in a set or bucket and handles the failure of an event processor. For a large number of instances, the data environment can be partitioned such that each monitoring component is assigned a partition of the workload. At intervals, each event processor sends a “heartbeat” message to the event processors in the bucket covering the same workload partition, to inform the other event processors of the status of the event processor sending the heartbeat. If it is determined that a heartbeat is received from each event processor in the bucket, a current process can continue. In the event of monitoring component failure, the instances can be repartitioned, and the remaining monitoring components can be assigned to the new partitions to substantially evenly distribute the workload.

A computer-implemented method may comprise receiving proposals to mutate a data stored in a distributed and replicated file system coupled to a network, the distributed and replicated data system comprising a plurality of nodes, each comprising a server. A metadata service maintains and updates a replica of a namespace of the distributed and replicated file system and coordinates updates to the data by generating an ordered set of agreements corresponding to the received proposals, the ordered set of agreements specifying an order in which the nodes are to mutate data stored in data nodes and cause corresponding changes to the state of the namespace. For each agreement in the generated ordered set of agreements, a corresponding writers list may be provided that comprises an ordered list of nodes to execute the agreement and make corresponding changes to the namespace. The ordered set of agreements may then be sent to the plurality of nodes along with, for each agreement in the ordered set of agreements, the corresponding writers list or a pre-generated index thereto and each of the plurality of nodes may be configured to only execute agreements for which it is a first-listed node on the received writers list.