Patent classifications
G06F3/067
Update of deduplication fingerprint index in a cache memory
In some examples, a system performs data deduplication using a deduplication fingerprint index in a hash data structure comprising a plurality of blocks, wherein a block of the plurality of blocks comprises fingerprints computed based on content of respective data values. The system merges, in a merge operation, updates for the deduplication fingerprint index to the hash data structure stored in a persistent storage. As part of the merge operation, the system mirrors the updates to a cached copy of the hash data structure in a cache memory, and updates, in an indirect block, information regarding locations of blocks in the cached copy of the hash data structure.
Load balancing across multiple data paths
Multiple data paths may be available to a data management system for transferring data between a primary storage device and a secondary storage device. The data management system may be able to gain operational advantages by performing load balancing across the multiple data paths. The system may use application layer characteristics of the data for transferring from a primary storage to a backup storage during data backup operation, and correspondingly from a secondary or backup storage system to a primary storage system during restoration.
Intelligent and automatic load balancing of workloads on replication appliances based on appliance load scores
Various systems and methods are provided in which a replication process is initiated between a primary site and a recovery site, each having plurality of gateway appliances. Replication loads are evaluated for each given gateway appliance of the plurality of gateway appliances. If a determination is made that at least one gateway appliance of the plurality of gateway appliances is not overloaded, the plurality of gateway appliances are sorted based on replication loads respectively associated with each gateway appliance, and a determination is made as to whether a relative difference in replication loads between a gateway appliance having a highest replication load and a gateway appliance having a lowest replication load exceeds a difference threshold to determine whether the replication workloads between the gateway appliances should be rebalanced.
Pre-positioning target content in a storage network
A method for execution in a storage network, the method begins by determining a user device group content preference, wherein the user group content includes target content for a user device group and the determining includes predicting future target content for the user group. The method continues by selecting a plurality of network edge units for staging encoded data slices, identifying target content for partial download to the plurality of network edge units and dispersed error encoding the target content to generate a set of encoded data slices. The method then continues by identifying encoded data slices from the set of encoded data slices corresponding to the target content for partial download and determining a partial downloading schedule for sending the encoded data slices for partial download to each network edge unit of the plurality of network edge units. The method continues by facilitating partial downloading of the target content by sending the encoded data slices for partial download to each network edge unit of the plurality of network edge units.
SYSTEMS AND METHODS FOR STORAGE MODELING AND COSTING
The present invention provides systems and methods for data storage. A hierarchical storage management architecture is presented to facilitate data management. The disclosed system provides methods for evaluating the state of stored data relative to enterprise needs by using weighted parameters that may be user defined. Also disclosed are systems and methods evaluating costing and risk management associated with stored data.
Massively Scalable Object Storage for Storing Object Replicas
An example method for storing data includes providing a plurality of physical storage pools, each storage pool including a plurality of storage nodes coupled to a network. The method also includes mapping a partition of a plurality of partitions to a set of physical storage pools, where each physical storage pool of the set of physical storage pools is located in a different availability zone, and the storage nodes within an availability zone are subject to a correlated loss of access to stored data. The method further includes receiving a data management request over the network, the data management request being associated with a data object. The method also includes identifying a first partition of the plurality of partitions corresponding to the received data management request and manipulating the data object in the physical storage pools mapped to the first partition in accordance with the data management request.
STORAGE SYSTEM
The storage system is capable of creating one or more virtual storage subsystems to which virtual resources having logically divided a processing capacity of the physical resources are allocated, and upon creating a virtual volume for receiving I/O requests from the host within the virtual storage subsystem, the virtual storage subsystem allocates the virtual resource to the virtual volume, and when an I/O request to the virtual volume is received from the host, performs processing related to the I/O request using the virtual resource having been allocated. According further to the storage system, after allocating the virtual resource to the virtual volume, the storage system raises a utilization rate of the virtual resource allocated to the virtual volume in a stepwise manner.
Chunk Monitoring
One example of a system includes a plurality of clients, a master chunk coordinator, and a plurality of chunk servers. Each client submits requests to access chunks of objects. The master chunk coordinator maintains chunk information for each object. Each chunk server includes a chunk monitor to monitor client requests, maintain chunk statistics for each chunk based on the monitoring, and transmit the chunk statistics for each chunk to the master chunk coordinator. The master chunk coordinator instructs the chunk servers to re-chunk objects, replicate chunks, migrate chunks, and resize chunks based on the chunk statistics to meet specified parameters.
MEMORY NETWORK TO PRIORITIZE PROCESSING OF A MEMORY ACCESS REQUEST
In one example, a memory network may control access to a shared memory that is by multiple compute nodes. The memory network may control the access to the shared memory by receiving a memory access request originating from an application executing on the multiple compute nodes and determining a priority for processing the memory access request. The priority determined by the memory network may correspond to a memory address range in the memory that is specifically used by the application.
IMAGE FILE DISTRIBUTION APPARATUS, IMAGE FILE RECOVERY APPARATUS, IMAGE FILE DISTRIBUTION METHOD, IMAGE FILE RECOVERY METHOD, IMAGE FILE DISTRIBUTION PROGRAM, IMAGE FILE RECOVERY PROGRAM, AND RECORDING MEDIUM STORING PROGRAM
Provided are an image file distribution apparatus, an image file recovery apparatus, an image file distribution method, an image file recovery method, an image file distribution program, an image file recovery program, and a recording medium storing the program which can prevent a relatively large increase in the amount of data of an image file even when an (k, n) secret sharing scheme with high security is used. For example, distributed tag information is obtained from tag information of the image file by a (k, n)-threshold secret sharing scheme. For example, distributed image data is obtained from image data by a (k, L, n)-threshold ramp secret sharing scheme. For example, the distributed tag information and the distributed image data are combined to obtain combined data. Since the amount of data in the tag information is small, the use of the (k, n) secret sharing scheme does not cause a large increase in the amount of data. Since the (k, L, n)-threshold ramp secret sharing scheme does not cause a large increase in the amount of data, an increase in the total amount of data in the image data is relatively small.