Patent application number | Description | Published |
20080288670 | USE OF VIRTUAL TARGETS FOR PREPARING AND SERVICING REQUESTS FOR SERVER-FREE DATA TRANSFER OPERATIONS - A system and method are disclosed for utilizing virtual targets and abstract copy orders in preparing and servicing requests for server-free data transfer operations in a data storage network. The abstract copy orders represent data transfers between virtual targets and real devices. They allow source target copy orders to be prepared separately from destination target copy orders. The abstract copy orders may then be converted into concrete copy orders involving only real device targets for execution by a data mover that implements the server free data transfer operations. | 11-20-2008 |
20110208912 | FULL-STRIPE-WRITE PROTOCOL FOR MAINTAINING PARITY COHERENCY IN A WRITE-BACK DISTRIBUTED REDUNDANCY DATA STORAGE SYSTEM - Data storage reliability is maintained in a write-back distributed data storage system including multiple nodes. Information is stored as a stripe including a collection of a data strips and associated parity strips, the stripe distributed across data and parity nodes. Each data node maintains the data strip holding a first copy of data, and each parity node maintains a parity strip holding a parity for the collection of data strips. A driver node initiates a full-stripe-write parity update protocol for maintaining parity coherency in conjunction with other nodes, to keep the relevant parity strips coherent. Parity is determined directly by computing parity strips for all data strips of a stripe. Any node may function as a driver node. | 08-25-2011 |
20110208994 | REBUILDING LOST DATA IN A DISTRIBUTED REDUNDANCY DATA STORAGE SYSTEM - Rebuilding lost data in a distributed redundancy data storage system including multiple nodes, is provided. User data is stored as a collection of stripes, each stripe comprising a collection of data strips and associated parity strips, the stripes distributed across multiple corresponding data owner nodes and multiple corresponding parity owner nodes. A data owner node maintains the associated data strip holding a first copy of data, and a parity owner node maintains a parity strip holding a parity for the collection of data strips. Upon detecting a failure condition, the owner node initiates a rebuilding protocol for recovery of lost data and/or parity it owns. The protocol includes reconstruction of lost data or parity by a computation involving data and/or parity from a recovery strip set in a stripe, wherein a recovery strip set contains at least one surviving data or parity strip. The recovery strip set for a lost data strip contains at least one surviving parity strip. | 08-25-2011 |
20120079492 | VECTOR THROTTLING TO CONTROL RESOURCE USE IN COMPUTER SYSTEMS - Embodiments are provided for managing the system performance of resources performing tasks in response to task requests from tenants. In one aspect, a system that comprises at least one resource configured to perform at least one admitted task with an impact under the control of a computer system. The computer system provides services to more than one tenant. The computer system comprises a strategist configured to assess the impact of the admitted task to create a cost function vector containing multiple cost function specifications and a budget policy vector containing multiple budget policies and an actuator. The actuator receives the cost function vector and the budget policy vector from the strategist, receives a task request one of the more than one tenants, and calculates cost functions based upon the cost function vector to predict the impact of the task request on the resources for each of the task requests. The actuator throttles the task requests based upon the budget policies for the impact on the resources to create at least one of the admitted task performed by the resource and a delayed task request. | 03-29-2012 |
20120311255 | FULL-STRIPE-WRITE PROTOCOL FOR MAINTAINING PARITY COHERENCY IN A WRITE-BACK DISTRIBUTED REDUNDANCY DATA STORAGE SYSTEM - Data storage reliability is maintained in a write-back distributed data storage system including multiple nodes. Information is stored as a stripe including a collection of a data strips and associated parity strips, the stripe distributed across data and parity nodes. Each data node maintains the data strip holding a first copy of data, and each parity node maintains a parity strip holding a parity for the collection of data strips. A driver node initiates a full-stripe-write parity update protocol for maintaining parity coherency in conjunction with other nodes, to keep the relevant parity strips coherent. Parity is determined directly by computing parity strips for all data strips of a stripe. Any node may function as a driver node. | 12-06-2012 |
20130007755 | METHODS, COMPUTER SYSTEMS, AND PHYSICAL COMPUTER STORAGE MEDIA FOR MANAGING RESOURCES OF A STORAGE SERVER - For managing a storage server having improving overall system performance, a first input/output (I/O) request is received. A first priority level is dynamically assigned to the first I/O request, the first I/O request associated with a performance level for an application residing on a host in communication with the storage server. A second I/O request of a second priority level is throttled to allow at least a portion of a predetermined amount of resources previously designated for performing the second I/O request to be re-allocated to performing the first I/O request. The second priority level is different than the first priority level. | 01-03-2013 |
20130007757 | METHODS, COMPUTER SYSTEMS, AND PHYSICAL COMPUTER STORAGE MEDIA FOR MANAGING RESOURCES OF A STORAGE SERVER - For managing a storage server having improving overall system performance, a first input/output (I/O) request is received. A first priority level is dynamically assigned to the first I/O request, the first I/O request associated with a performance level for an application residing on a host in communication with the storage server. A second I/O request of a second priority level is throttled to allow at least a portion of a predetermined amount of resources previously designated for performing the second I/O request to be re-allocated to performing the first I/O request. The second priority level is different than the first priority level. | 01-03-2013 |
20130074087 | METHODS, SYSTEMS, AND PHYSICAL COMPUTER STORAGE MEDIA FOR PROCESSING A PLURALITY OF INPUT/OUTPUT REQUEST JOBS - Methods, systems, and physical computer-readable storage medium for processing a plurality of IO request jobs are provided. The method includes determining whether one or more request jobs are not meeting a QoS target, each job of the one or more request jobs having a corresponding priority, selecting a highest priority job from the one or more request jobs, if one or more request jobs are not meeting the QoS target, determining whether the highest priority job has a corresponding effective rate limit imposed thereon, if so, relaxing the corresponding effective rate limit, and if not, selecting one or more lower priority jobs from the one or more request jobs and tightening a corresponding effective limit on the one or more lower priority jobs from the one or more request jobs in accordance with a delay factor limit. | 03-21-2013 |
20130111026 | SERIALIZATION OF ACCESS TO DATA IN MULTIMAINFRAME COMPUTING ENVIRONMENTS | 05-02-2013 |
20130111557 | ACCESS CONTROL IN A HYBRID ENVIRONMENT | 05-02-2013 |
20130111563 | ACCESS CONTROL IN A HYBRID ENVIRONMENT | 05-02-2013 |
20130198148 | ESTIMATING DATA REDUCTION IN STORAGE SYSTEMS - Embodiments of the present invention provide a system, method and computer program products for estimating data reduction in a file system. A method includes selecting a sample of all data from data files in the file system, wherein said sample represent a subset of all the data in the file system. The method further includes estimating a data reduction ratio by data deduplication for the file system based on said sample. The method further includes estimating a data reduction ratio by data compression for the file system based said sample. The method further includes generating a combined data reduction estimate for the file system based on said data compression estimate and said data deduplication estimate. | 08-01-2013 |
20130290276 | ENHANCING PERFORMANCE-COST RATIO OF A PRIMARY STORAGE ADAPATIVE DATA REDUCTION SYSTEM - Data reduction in a storage system comprises determining attributes of data for storage in the storage system and determining expected data reduction effectiveness for the data based on said attributes. Said effectiveness indicates the benefit that data reduction is expected to provide for the data based on said attributes. The data reduction further comprises applying data reduction to the data based on the expected data reduction effectiveness and performance impact, to improve resource usage efficiency. | 10-31-2013 |
20130290277 | DEDUPLICATING STORAGE WITH ENHANCED FREQUENT-BLOCK DETECTION - Detecting data duplication comprises maintaining a fingerprint directory including one or more entries, each entry including a data fingerprint and a data location for a data chunk. Each entry is associated with a seen-count attribute which is an indication of how often the fingerprint has been seen in arriving data chunks. Higher-frequency entries in the directory are retained, while also taking into account recency of data accesses. A data duplication detector detects that the data fingerprint for a new chunk is the same as the data fingerprint contained in an entry in the fingerprint directory. | 10-31-2013 |
20140095789 | MANAGEMENT OF DATA USING INHERITABLE ATTRIBUTES - Embodiments relate to a system and computer program product for data management. An aspect includes a method for assigning storage types to data based on access frequency. Past or historical data associated with current data usage is also considered prior to assignment. Once data frequency access is determined, the current data is assigned to a first tier of a plurality of hierarchical ordered tiers, each tier corresponding to at least one class of storage. In one embodiment, there may be a condition that overrides the assignment with option to override it. The tier assignment may also be preserved so that the current data can be appropriately assigned in the future. | 04-03-2014 |
20140095790 | MANAGEMENT OF DATA USING INHERITABLE ATTRIBUTES - Embodiments relate to a method for data management. An aspect includes a method for assigning storage types to data based on access frequency. Past or historical data associated with current data usage is also considered prior to assignment. Once data frequency access is determined, the current data is assigned to a first tier of a plurality of hierarchical ordered tiers, each tier corresponding to at least one class of storage. In one embodiment, there may be a condition that overrides the assignment with option to override it. The tier assignment may also be preserved the tier so that the current data can be appropriately assigned in the future. | 04-03-2014 |
20140101667 | AUTHENTICATING A PROCESSING SYSTEM ACCESSING A RESOURCE - Provided are a method, system, and article of manufacture for authenticating a processing system accessing a resource. An association of processing system identifiers with resources, including a first and second resources, is maintained. A request from a requesting processing system in a host is received for use of a first resource that provides access to a second resource, wherein the request is generated by processing system software and wherein the request further includes a submitted processing system identifier included in the request by host hardware in the host. A determination is made as to whether the submitted processing system identifier is one of the processing system identifiers associated with the first and second resources. The requesting processing system is provided access to the first resource that the processing system uses to access the second resource. | 04-10-2014 |
20140122685 | Data Storage to Optimize Revenue Realized Under Multiple Service Level Agreements - A data storage system comprising a Quality of Service server to optimize revenue realized under multiple service level agreements with a data storage client. | 05-01-2014 |
20140122795 | DATA PLACEMENT FOR LOSS PROTECTION IN A STORAGE SYSTEM - Embodiments of the invention relate to data placement for loss protection in a storage system. One embodiment includes constructing multiple logical compartments. Each logical compartment includes a placement policy including a set of storage placement rules for placement of storage symbols into a set of physical storage containers. A first logical compartment of said plurality of logical compartments is container-overlapped with respect to a second logical compartment of said plurality of logical compartments. The first logical compartment is data loss independent with respect to the second logical compartment. Each of multiple storage volumes is associated with a logical compartment. The storage symbols that represent a data stripe are placed onto physical storage containers in conformity with the placement policy associated with the logical compartment containing the data stripe. | 05-01-2014 |
20140310244 | ESSENTIAL METADATA REPLICATION - Methods, apparatus and computer program products implement embodiments of the present invention that include defining, in a storage system including receiving, by a storage system, a storage request, and identifying, based on the storage request, one or more storage management units. For each of the storage management units, a master partition table having multiple master entries and one or more backup partition tables is identified, each of the backup partition tables having backup entries in a one-to-one-correspondence with the master entries. The storage request is performed, and upon the storage request being performed, any changes to essential metadata in the one or more master partition tables are identified, and the identified changes are stored to the essential metadata in the one or more backup partition tables. | 10-16-2014 |
20140310456 | FINE-GRAINED CONTROL OF DATA PLACEMENT - Methods, apparatus and computer program products implement embodiments of the present invention that include defining, in a storage system including multiple storage devices, multiple redundant array of independent disks (RAID) configurations for data stored on the storage devices. A first one of the multiple RAID configurations is assigned to a first entry in a partition table having multiple entries, and a second one of the multiple RAID configurations is assigned to a second entry in the partition table, the second one of the multiple RAID configurations independent from the first one of the multiple RAID configurations. | 10-16-2014 |
20140310457 | LOGICAL REGION ALLOCATION WITH IMMEDIATE AVAILABILITY - Methods, apparatus and computer program products implement embodiments of the present invention that enable a computer to receive a request to allocate one or more logical regions to a logical volume, and to verify, in response to the request, an availability on one or more storage devices of a number of physical regions corresponding to the one or more requested logical regions. In response to the verification, the one or more logical regions can be activated for write operations to a cache, so that any data written to the logical regions is stored to the cache. Subsequent to activating the one or more logical regions, one or more actual physical regions can be allocated to the logical volume. Upon allocating the one or more actual physical regions, any data stored in the cache can be destaged to the one or more actual physical regions. | 10-16-2014 |
20140310464 | PARALLEL DESTAGING WITH REPLICATED CACHE PINNING - Methods, apparatus and computer program products implement embodiments of the present invention that include identifying non-destaged first data in a write cache. Upon detecting second data in a master read cache, the second data is copied the second data to one or more backup read caches, and the second data is pinned to the master and the backup read caches. Using the first data stored in the write cache and the second data stored in the master read cache, one or more parity values are calculated, and the first data and the one or more parity values are destaged. | 10-16-2014 |
20140310465 | BACKUP CACHE WITH IMMEDIATE AVAILABILITY - Methods, apparatus and computer program products implement embodiments of the present invention that include defining, in a storage system including receiving, by a processor, metadata describing a first cache configured as a master cache having non-destaged data, and defining, using the received metadata, a second cache configured as a backup cache for the master cache. Subsequent to defining the second cache, the non-destaged data is retrieved from the first cache, and the non-destaged data is stored to the second cache. | 10-16-2014 |
20140310489 | MANAGING METADATA AND DATA FOR A LOGICAL VOLUME IN A DISTRIBUTED AND DECLUSTERED SYSTEM - Methods, apparatus and computer program products for a distributed system include dividing logical volume data into data subsets, and defining at least one distributedly storage configuration for the logical volume. Metadata for the logical volume is written to a first set of first metadata tables, and the first set of first metadata tables is divided into metadata subsets having a one-to-one correspondence with the data subsets. The metadata subsets are distributed among the multiple digital information devices, and the metadata is copied from the first set of first metadata tables to a second set of corresponding second metadata tables in a one-to-one correspondence with the first metadata tables. The second metadata tables are distributed among the multiple digital information devices, and upon modifying the metadata in a one of the first metadata tables while processing a storage request, the corresponding second metadata table is revised with the updated metadata. | 10-16-2014 |
20140310557 | DESTAGING CACHE DATA USING A DISTRIBUTED FREEZER - Methods, apparatus and computer program products implement embodiments of the present invention that enable digital information devices having respective storage devices and memories to distributedly store, for a logical volume, data and first and second parity values across corresponding regions of the storage devices. Freezers having a one-to-one correspondence with the storage devices are distributedly stored in the memories. Upon detecting, in a cache, updated data for one or more first regions on the storage devices, existing data from the one or more first regions, and additional data for parity calculations are retrieved from one or more corresponding second regions on the storage devices, and first and the second parity values are calculated using the updated data, the existing data and the additional data. The updated data and the calculated first and second parity values are stored to the freezers, and then destaged from the freezers to the storage devices. | 10-16-2014 |
20140333457 | Random Extraction From Compressed Data - Aspects of the invention are provided for decoding a selected span of data within a compressed code stream. A selection of data within the compressed code stream from an arbitrary position is presented for decompression. The arbitrary position is the starting point in the compressed code stream for decompression, and a phrase within the compressed code stream containing the starting point is identified. From the arbitrary starting point, a back pointer may provide direction to the literal. The literal is extracted as a decoding of the compressed data associated with the starting point. | 11-13-2014 |
20140358857 | DE-DUPLICATION WITH PARTITIONING ADVICE AND AUTOMATION - Migrating a sub-volume in data storage with at least two de-duplication domains, each of the domains having at least one sub-volume. A first sub-volume is assigned to a de-duplication domain and a first content summary is computed for the first sub-volume. Similarly, a second sub-volume is assigned to a second de-duplication domains and a second content summary is computed for the second sub-volume. A first content affinity is calculated between the first sub-volume and a third sub-volume, and a second content affinity is calculated between the second sub-volume and the third sub-volume. A domain placement is selected for the third sub-volume based on comparison of the first content affinity and the second content affinity. | 12-04-2014 |
20140358867 | DE-DUPLICATION DEPLOYMENT PLANNING - Assignment of files to a de-duplication domain. Address space of data files is divided into multiple containers. For each of the containers, a file metadata scan is performed to obtain file system metadata, which is aggregated and summarized in a content feature summary. A content feature summary prediction measurement is measured between containers from the generated content feature summary, and files from each container are assigned to a de-duplication domain based upon the content similarity predication measurement. | 12-04-2014 |
20140358870 | DE-DUPLICATION DEPLOYMENT PLANNING - Assignment of files to a de-duplication domain. Address space of data files is divided into multiple containers. For each of the containers, a file metadata scan is performed to obtain file system metadata, which is aggregated and summarized in a content feature summary. A content feature summary prediction measurement is measured between containers from the generated content feature summary, and files from each container are assigned to a de-duplication domain based upon the content similarity predication measurement. | 12-04-2014 |
20140359244 | DE-DUPLICATION WITH PARTITIONING ADVICE AND AUTOMATION - Migrating a sub-volume in data storage with at least two de-duplication domains, each of the domains having at least one sub-volume. A first sub-volume is assigned to a de-duplication domain and a first content summary is computed for the first sub-volume. Similarly, a second sub-volume is assigned to a second de-duplication domains and a second content summary is computed for the second sub-volume. A first content affinity is calculated between the first sub-volume and a third sub-volume, and a second content affinity is calculated between the second sub-volume and the third sub-volume. A domain placement is selected for the third sub-volume based on comparison of the first content affinity and the second content affinity. | 12-04-2014 |
20140365449 | INLINE LEARNING-BASED SELECTIVE DEDUPLICATION FOR PRIMARY STORAGE SYSTEMS - A computing device receives a plurality of writes; each write is comprised of chunks of data. The computing device records metrics associated with the deduplication of the chunks of data from the plurality of writes. The computing device generates groups based on associating each group with a portion of a range of the metrics, such that each of the chunks of data are associated with one of the groups, and a similar number of chunks of data are associated with each group. The computing device determines a deduplication affinity for each of the groups based on the chunks of data that are duplicates and at least one metric. The computing device sets a threshold for the deduplication affinity and in response to any of the groups exceeding the threshold, the computing device excluding the chunks of data associated with a group exceeding the threshold, from deduplication. | 12-11-2014 |
20150113116 | PROBLEM DETERMINATION IN A HYBRID ENVIRONMENT - A multi-mainframe system problem determination method includes recording, in a first computing system, diagnostic data, receiving, in the first computing system, a data collection trigger, responsive to the data collection trigger, coordinating, in the first computing system, synchronized collection of recorded diagnostic data with a second computing system and delivering collected diagnostic data to a storage medium. | 04-23-2015 |
20150113130 | PROBLEM DETERMINATION IN A HYBRID ENVIRONMENT - A multi-mainframe system problem determination method includes receiving, in a first computing system, a data collection trigger, coordinating, in the first computing system, synchronized diagnostic data collection with a second computing system, and delivering the diagnostic data to a storage medium. | 04-23-2015 |
20150161011 | DATA PLACEMENT FOR LOSS PROTECTION IN A STORAGE SYSTEM - Embodiments of the invention relate to data placement for loss protection in a storage system. One embodiment includes constructing multiple logical compartments. Each logical compartment includes a placement policy including a set of storage placement rules for determining permitted placement of storage symbols on specific physical storage containers, and a balancing policy for determining a particular placement of the storage symbols among permitted placements for balancing the storage symbols for each volume among the physical storage containers that is useable within the placement policy. | 06-11-2015 |
20150205526 | QUEUING LATENCY FEEDBACK MECHANISM TO IMPROVE I/O PERFORMANCE - A method for improving I/O performance using queuing latency feedback initially generates, at a host system, I/O for processing on a storage system. The I/O is received at the storage system and queuing latency experienced by the I/O is measured as the I/O is processed by the storage system. The queuing latency is returned to the host system. The host system may use the queuing latency to understand delays and resource contention within the storage system and enable the host system to more effectively take actions that improve I/O performance and compliance with SLAs. A corresponding system and computer program product are also disclosed. | 07-23-2015 |
20150268883 | MANAGING METADATA AND DATA FOR A LOGICAL VOLUME IN A DISTRIBUTED AND DECLUSTERED SYSTEM - Methods, apparatus and computer program products for a distributed system include dividing logical volume data into data subsets, and defining at least one distributedly storage configuration for the logical volume. Metadata for the logical volume is written to a first set of first metadata tables, and the first set of first metadata tables is divided into metadata subsets having a one-to-one correspondence with the data subsets. The metadata subsets are distributed among the multiple digital information devices, and the metadata is copied from the first set of first metadata tables to a second set of corresponding second metadata tables in a one-to-one correspondence with the first metadata tables, and the second metadata tables are distributed among the multiple digital information devices. | 09-24-2015 |
20150268884 | MANAGING METADATA AND DATA FOR A LOGICAL VOLUME IN A DISTRIBUTED AND DECLUSTERED SYSTEM - Methods, apparatus and computer program products for a distributed system include dividing logical volume data into data subsets, and defining at least one distributedly storage configuration for the logical volume. Metadata for the logical volume is written to a first set of first metadata tables, and the first set of first metadata tables is divided into metadata subsets having a one-to-one correspondence with the data subsets. The metadata subsets are distributed among the multiple digital information devices, and the metadata is copied from the first set of first metadata tables to a second set of corresponding second metadata tables in a one-to-one correspondence with the first metadata tables. | 09-24-2015 |
20150269026 | DESTAGING CACHE DATA USING A DISTRIBUTED FREEZER - Methods, apparatus and computer program products implement embodiments of the present invention that enable digital information devices having respective storage devices and memories to distributedly store, for a logical volume, data and first and second parity values across corresponding regions of the storage devices. Freezers having a one-to-one correspondence with the storage devices are distributedly stored in the memories. Upon detecting, in a cache, updated data for one or more first regions on the storage devices, existing data from the one or more first regions, and additional data for parity calculations are retrieved from one or more corresponding second regions on the storage devices, and first and the second parity values are calculated using the updated data, the existing data and the additional data, and the updated data and the calculated first and second parity values are stored to the freezers. | 09-24-2015 |