Abstract:
Techniques for data replication are presented. A snap shot request is processed within an environment associated with a local volume by flushing pending Input/Output (I/O) operations into an event packet. The event packet is sent to a replicated volume and processed against the replicated volume to create a snap shot version of the local volume.
Abstract:
Techniques for achieving tenant data confidentiality in a cloud environment are presented. A daemon process within a Tenant Storage Machine (TSM) manages a key store for a particular tenant of a cloud storage environment having multiple other tenants. Just TSM storage processes are given access to the key store. Data is decrypted for the particular tenant when access is needed and data is encrypted using encryption keys of the key store when written in the cloud storage environment.
Abstract:
Techniques for data replication are presented. A snap shot request is processed within an environment associated with a local volume by flushing pending Input/Output (I/O) operations into an event packet. The event packet is sent to a replicated volume and processed against the replicated volume to create a snap shot version of the local volume.
Abstract:
Techniques for achieving tenant data confidentiality in a cloud environment are presented. A daemon process within a Tenant Storage Machine (TSM) manages a key store for a particular tenant of a cloud storage environment having multiple other tenants. Just TSM storage processes are given access to the key store. Data is decrypted for the particular tenant when access is needed and data is encrypted using encryption keys of the key store when written in the cloud storage environment.
Abstract:
A method and system is provided for computing a final cyclic redundancy check (CRC) checksum for an entire data block. The method includes segmenting the data block into at least first and second segments and calculating a partial CRC for each segment. A residue table T is calculated that has ‘R’ entries, where the CRC is R-bits in length. An effective CRC is initialized and the entries of the residue table corresponding to nonzero bits of the partial CRC of the first segment are summed. The final CRC for the data block is computed as the sum of the effective CRC and the partial CRC of the second segment.
Abstract:
Techniques for translating Service Level Agreement (SLA) policy into storage controller requirements within a cloud storage environment are presented. System resource metrics for a storage controller are derived. The SLA policy is defined in terms of SLA parameters. Heuristics are used to translate the SLA parameters into defined percentages of system resources for the storage controller, which are compared to the system resource metrics and adjustments are updates are made as needed.
Abstract:
Techniques for the session sensitive data backups and restores are presented. Data having a plurality of hard linked file references are backed up and restored once during a backup operation. Any modifications to the backed up data are noted as session-specific versions and also backed up once. The hard linked file references are maintained in a data structure and managed during backups to define associations to the backed up data and to the session-specific versions of the data. The data structure is also used during restores to re-establish desired hard linked file reference associations to either the backed up data or to a particular session-specific versions of the data.
Abstract:
Techniques for the session sensitive data backups and restores are presented. Data having a plurality of hard linked file references are backed up and restored once during a backup operation. Any modifications to the backed up data are noted as session-specific versions and also backed up once. The hard linked file references are maintained in a data structure and managed during backups to define associations to the backed up data and to the session-specific versions of the data. The data structure is also used during restores to re-establish desired hard linked file reference associations to either the backed up data or to a particular session -specific versions of the data.
Abstract:
Techniques for asynchronous data replication are presented. A bitmap records changes to selective blocks of data on a source between replication periods. During a replication, the bitmap is copied and used to acquire changed blocks from the source to write to a replica. Should a unprocessed block have a pending write detected during the replication, then that block is copied into cache from the source before the write is processed on the source. The pending write then processes against the source; the copied block is flushed to the replica; the original bitmap and copied bitmap are updated.