Abstract:
Methods and systems for backing up and restoring different point in time versions of a virtual machine, an application, a database, or an electronic file using independently managed snapshot chains are described. In some cases, different point in time versions of a virtual machine may be captured and stored using one or more snapshot chains. Each snapshot chain may correspond with a base image (e.g., a full image snapshot) and one or more incremental files (e.g., two forward incremental files) that derive from the base image. A snapshot chain may be split into a plurality of shards or sub-chains such that the width of each shard or the maximum data size of the files in each shard is less than a threshold data size (e.g., is less than 1TB). Data operations (e.g., consolidation and reverse operations) may be performed on the individual shards or sub-chains in parallel.
Abstract:
There are a large number of operation workload reallocating plans, but in terms of a required calculation resource, it is undesirable to, in each case, derive power consumption required for a cooling apparatus, select and control operation workload deployment for minimizing a total value of the derived power consumption and server power. The present invention derives a rule about the IT workload allocation in advance from configuration information (static information) including position information of facilities including an air conditioner of the data center and the IT equipment items, changes priority of an applied rule on the basis of dynamic information including ambient temperature, and changes the IT workload allocation, thereby reducing the power consumption of the air conditioner. (see Fig. 1)
Abstract:
A data management system respectively computes first hash values while sliding a window a prescribed amount at a time with respect to a prescribed range from a start location of a data block to a prescribed size. The system extracts, from among the first hash values, a first hash value, which is equivalent to a characteristic value, and partitions the data block into a first chunk of data at a location corresponding to this first hash value. The system determines coincidence between a first chunk of data and a stored second chunk of data, and prevents duplicate data from being stored twice.
Abstract:
A method and system is provided for copying data between two deduplicating storage systems. A list of unique fingerprints is compiled from the data which will be sent. This list is transmitted to the receiving system during a preliminary data exchange called the preamble. The receiving system replies with a second list which contains the unique fingerprints of the data which either needs to be sent or can be omitted. Which list depends on the size of the list where the smaller list is sent for efficiency and lower bandwidth consumption. A reference list of duplicate blocks being sent is retained on the receiving system until the copy operation is complete. This reference list is used to protect blocks on the receiving system by deferring deletions until the incoming hallow block can reference the duplicate block on the receiver to confirm that is on the target system and should not be deleted.
Abstract:
A serial ATA interface (300) calibrates serially connected components of a computer system (320) linked by the interface to a negociated data transmission speed. The interface negociates the fastest data transmission speed supported by the serially connected components. Link parameters associated with the negociated data transmission speed are cablirated and implemented in a Physical layer of the interface data before data is transmitted accross the interface. The cablirated link parameters include signal settings for amplitude, pre-emphasis, equalization and timing. Default settings of the link parameters correspond to the slowest data transmissio speed supported by the serially connected components. The serially connected components are calibrated each time system power is initialized, the serially connected components can be a host computer (310) linked to a data storage device such as a backplane-base storage subsystem (320).
Abstract:
A data storage system having a host computer/server coupled through an interface to a bank of disk drives having a plurality of disk units, each one of such disk drive units having a magnetic storage media. The interface includes: a plurality of front-end directors; a plurality of back end directors; and, a global cache memory available for caching user data for the plurality of disk drives. The global cache memory comprises a plurality of non-volatile memory global cache memory sections distributed among disk drive units within the bank of disk drive units. The non-volatile memory global cache memory sections, connected to the back-end directors, caches user data for the magnetic storage media of the plurality of disk drive units independent of the one of the disk drive units having such one of the non-volatile memory global cache memory sections.
Abstract:
Provided are techniques for storing local versions of a data set. A first number that indicates how many local versions of the data set are to be stored in local storage given an amount of available local storage is received. It is determined whether a second number that indicates a total number of local versions of the data set that the local storage is capable of storing exceeds the first number. In response to determining that the second number exceeds the first number, the amount of local storage that is capable of storing the first number of local versions of the data set is used.