An object of the present invention is to realize a proper storage operation in accordance with the state of a storage devices which constructed remote copy pair via a network. A first storage device for providing a first volume and a second storage device for providing a second volume as a remote copy destination of the first volume, includes: a storing unit for policy sets that is a regulation group relating to the service quality of the second volume; and a policy selection unit for selecting a policy set to be used from the plurality of policy sets in accordance with the states of the first volume and the second storage device. According to such a configuration and operation, it is possible to properly operate the storage device by selecting a policy set before and after the failover or according to the presence or absence of degeneration.

The present disclosure relates to devices, methods, and computer-readable medium for providing recommendations for alternate resources to use for cloud services. The devices, methods, and computer-readable medium may receive a resource allocation request for a new resource of a computing system and may predict an occurrence of a capacity related allocation for the resource allocation request. The devices, methods, and computer-readable medium may identify alternate resources to use for the resource allocation request and may provide recommendations with the alternate resources.

The present disclosure relates to devices, methods, and computer-readable medium for providing recommendations for alternate resources to use for cloud services. The devices, methods, and computer-readable medium may receive a resource allocation request for a new resource of a computing system and may predict an occurrence of a capacity related allocation for the resource allocation request. The devices, methods, and computer-readable medium may identify alternate resources to use for the resource allocation request and may provide recommendations with the alternate resources.

A technique replicates an index of an operations log (oplog) from a primary node to a secondary node of a cluster in the event of failure. The oplog functions as a staging area to coalesce random write operations directed to a virtual disk (vdisk) stored on a backend storage tier. The oplog temporarily caches write data as well as metadata describing the write data. The metadata includes descriptors to the write data corresponding to offset ranges of the vdisk and are used to identify ranges of write data for the vdisk that are cached in the oplog. To facilitate fast lookup operations of whether write data is cached in the oplog, an oplog index provides a state of the latest data for offset ranges of the vdisk that enables fast failover of metadata used to construct the oplog index in memory without downtime or significant metadata replay.

A data reporting method includes generating a data uploading token by a main network node, determining, from a plurality of data-uploading network nodes waiting for data uploading, a plurality of qualified network nodes having a data uploading qualification, allowing the qualified network nodes to compete for the data uploading token, and coordinating a data uploading operation with a winning network node of the qualified network nodes that obtained the data uploading token.

In general, embodiments of the invention relate to storing data and managing the stored data in linked nodes. More specifically, embodiments of the invention relate to nodes linked together in a daisy chain configuration such as, but not limited to, a single-chain configuration and a dual-chain configuration, which use data protection domain (DPD) information to determine where and/or how to store the data.

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 remote data replication method and a storage system, where a production array sends a data replication request to a disaster recovery array. The data replication request includes an identifier of a source object and a data block corresponding to the source object. The data block is stored in physical space of a hard disk of the production array. The disaster recovery array receives the data replication request. The disaster recovery array creates a target object when the disaster recovery array does not include an object having a same identifier as the source object. An identifier of the target object is the same as the identifier of the source object, the disaster recovery array writes the data block into the physical space.

Systems and methods for reducing delays between the time at which a need for a resynchronization of data replication between a volume of a local CG and its peer volume of a remote CG is detected and the time at which the resynchronization is triggered (Reseed Time Period) are provided. According to an example, information indicative of the direction of data replication between the volume and the peer volume is maintained within a cache of a node. Responsive to a disruptive operation (e.g., relocation of the volume from an original node to a new node), the Reseed Time Period is lessened by proactively adding a passive cache entry to a cache within the new node at the time the CG relationship is created when the new node represents an HA partner of the original node and prior to the volume coming online when the new node represents a non-HA partner.

Aspects of the innovations herein are consistent with a storage system for storing variable sized objects. According to certain implementations, the storage system may be a transaction-based system that uses variable sized objects to store data, and/or may be implemented using data stores, such as arrays disks arranged in ranks. In some exemplary implementations, each rank may include multiple stripes, each stripe may be read and written as a convenient unit for maximum performance, and/or a rank manager may be provided to dynamically configure the ranks. In certain implementations, the storage system may include a stripe space table that contains entries describing the amount of space used in each stripe. Further, an object map may provide entries for each object in the storage system describing the location, the length and/or version of the object.