Patent application number | Description | Published |
20080276017 | SYSTEM AND ARTICLE OF MANUFACTURE FOR THE DETECTION OF MISDIRECTED DATA - Provided are a system and article of manufacture, wherein in certain embodiments an I/O command from a host is received at a first storage unit. An identifier is generated that identifies a destination to which the I/O command is to be transmitted from the first storage unit. The I/O command is augmented with the generated identifier at the first storage unit. The augmented I/O command is transmitted. In certain other embodiments, an I/O command is received at a storage unit, wherein the storage unit is associated with a storage unit identifier. A determination is made at the storage unit, whether the I/O command is associated with an identifier that identifies a destination for which the I/O command is intended. A further determination is made, at the storage unit, whether the identifier is the same as the storage unit identifier, in response to determining that the identifier associated with the I/O command identifies the destination for which the I/O command is intended. | 11-06-2008 |
20080294861 | RESTRICTING THE EXECUTION OF COPY SERVICES COMMANDS - A system and method for controlling peer-to-peer remote copy (PPRC) operations initiated from one or more host devices that desire to store data contents written to a first storage system to a second storage system over a communications link. The system enables receipt and generation of copy services commands from host devices and the determination of whether a received command pertains to a copy service over an established PPRC relationship for that particular customer to enable that customer to perform storage operations effecting data written to a first storage server having source volumes and stored in a remote second storage system having target volumes. The copy services command effecting data contents of source volumes and/or remote target volumes will be enabled if it is determined that said PPRC relationship is already established for that customer; and, prevented if the received copy services command does effect any volume not already in a copy services relationship. | 11-27-2008 |
20090089791 | RESOURCE ALLOCATION UNIT QUEUE - Provided is a system, deployment and program for resource allocation unit queuing in which an allocation unit associated with a task is classified. An allocation unit freed as the task ends is queued for use by another task in a queue at a selected location within the queue in accordance with the classification of said allocation unit. In one embodiment, an allocation unit is queued at a first end of the queue if classified in a first class and is queued at a second end of the queue if classified in said second class. Other embodiments are described and claimed. | 04-02-2009 |
20090150626 | DETERMINING WHETHER TO USE A FULL VOLUME OR REPOSITORY FOR A LOGICAL COPY BACKUP SPACE - Provided are a method, system, and article of manufacture for determining whether to use a full volume or repository for a logical copy backup space. A determination is made of a source volume to backup using a logical copy operation. The logical copy operation is completed upon indicating the source volume data to backup. During a logical copy duration, point-in-time data in the source volume as of a point-in-time when the logical copy was established is copied to a backup space in response to receiving an update to the point-in-time data. A history of writes to the source volume is processed to determine whether to allocate a full target volume as the backup space providing a corresponding data unit for each data unit in the source volume or allocate a repository as the backup space, wherein the repository uses less storage space than the full target volume. The logical copy operation using the determined full target volume or repository as the backup space is initiated. | 06-11-2009 |
20090150627 | DETERMINING WHETHER TO USE A REPOSITORY TO STORE DATA UPDATED DURING A RESYNCHRONIZATION - Provided are a method, system, and article of manufacture for determining whether to use a repository to store data updated during a resynchronization. Writes to a primary storage are transferred to a secondary storage. A logical copy of the secondary storage as of a point-in-time is established. Writes to the secondary storage in the logical copy received from the primary storage during a logical copy duration after the point-in-time are stored in a repository that comprises less storage space than the secondary storage in the logical copy. The transferring of writes to the secondary storage is suspended. During the suspension writes to the primary storage are indicated in an out-of-synch data structure. A determination is made as to as to whether available storage space in the repository is sufficient to store writes transferred from the secondary storage while transferring the writes from the out-of-synch data structure in response to ending the suspension of the transferring of writes from the primary to the secondary storages. The repository is used to store data in the secondary storage as of the point-in-time that is to be updated by writes transferred from the primary storage following the ending of the suspension in response to determining that the available storage space in the repository is sufficient to store writes transferred from the secondary storage while transferring the writes indicated in the out-of-synch data structure. | 06-11-2009 |
20090177676 | APPARATUS, SYSTEM, AND METHOD FOR STORING AND RETRIEVING COMPRESSED DATA - An apparatus, system, and method are disclosed for storing and retrieving compressed data. A compression module compresses a data file organized in logical tracks. A ratio module determines a track compression ratio. The track compression ratio is a ratio of an integer value n to one. A destage module destages a single directory entry for the data file to a directory. The directory entry points to a zeroth track on a hard disk drive. The destage module further destages the data file sequentially to tracks of the hard disk drive from the zeroth track with n logical tracks of the data file stored on one physical track of the hard disk drive. A stage module stages a kth logical track from a physical track of the hard disk drive. The physical track is specified by an integer value of k divided by n. | 07-09-2009 |
20090216954 | APPARATUS, SYSTEM, AND METHOD FOR SELECTING A SPACE EFFICIENT REPOSITORY - An apparatus, system, and method are disclosed for selecting a space efficient repository. A cache receives write data. A destage module destages the data sequentially to a coarse grained repository such as a stride level repository and destages a directory entry for the data to a coarse grained directory such as a stride level directory if the data satisfies a repository policy. In addition, the destage module destages the data to a fine grained repository such as a track level repository overwriting an existing data instance and destages the directory entry to a fine grained directory such as a track level directory if the data does not satisfy the repository policy. | 08-27-2009 |
20090300298 | MEMORY PRESERVED CACHE TO PREVENT DATA LOSS - A method, system, and computer program product for preserving data in a storage subsystem having dual cache and dual nonvolatile storage (NVS) through a failover from a failed cluster to a surviving cluster is provided. A memory preserved indicator is initiated to mark tracks on a cache of the surviving cluster to be preserved, the tracks having an image in an NVS of the failed cluster. A destage operation is performed to destage the marked tracks. Subsequent to a determination that each of the marked tracks have been destaged, the memory preserved indicator is disabled to remove the mark from the tracks. If the surviving cluster reboots previous to each of the marked tracks having been destaged, the cache is verified as a memory preserved cache, the marked tracks are retained for processing while all unmarked tracks are removed, and the marked tracks are processed. | 12-03-2009 |
20090300408 | MEMORY PRESERVED CACHE FAILSAFE REBOOT MECHANISM - A method, system and computer program product for preserving data in a storage subsystem having dual cache and dual nonvolatile storage (NVS) through a failover from a failed cluster to a surviving cluster, the surviving cluster undergoing a rebooting process, is provided. A memory preserved indicator associated with a cache of the surviving cluster is detected. The memory preserved indicator designates marked tracks having an image in an NVS of the failed cluster to be preserved through the rebooting process. A counter in a data structure of the surviving cache is incremented. If a value of the counter exceeds a predetermined value, a cache memory is initialized, and the marked tracks are removed from the cache to prevent an instance of repetitive reboots caused by a corrupted structure in the cache memory. | 12-03-2009 |
20090307453 | MAINTAINING INFORMATION OF A RELATIONSHIP OF TARGET VOLUMES COMPRISING LOGICAL COPIES OF A SOURCE VOLUME - Provided are a method, system, and article of manufacture for maintaining information of a relationship of target volumes comprising logical copies of a source volume. Information is maintained on a source volume having a plurality of data units and a plurality of target volumes created at different points-in-time maintaining a logical copy of the data units in the source volume for the different points-in-time. A source downstream pointer is generated for each data unit in the source volume to point to a corresponding data unit in a first target volume. For each target volume data unit whose data is maintained in the source volume or another one of the target volumes, a first upstream pointer is generated indicating one of the source and target volumes from which the target volume data unit inherits data. For each target volume data unit whose data is maintained in the source volume or another one of the target volumes, generating a second upstream pointer indicating one of the source and target volumes having the data for the data unit. | 12-10-2009 |
20100037226 | GROUPING AND DISPATCHING SCANS IN CACHE - A method, system, and computer program product for grouping and dispatching scans in a cache directory of a processing environment is provided. A plurality of scan tasks is aggregated from a scan wait queue into a scan task queue. The plurality of scan tasks is determined by selecting one of (1) each of the plurality of scan tasks on the scan wait queue, (2) a predetermined number of the plurality of scan tasks on the scan wait queue, and (3) a set of scan tasks of a similar type on the scan wait queue. A first scan task from the plurality of scan tasks is selected from the scan task queue. The scan task is performed. | 02-11-2010 |
20100161902 | METHOD, SYSTEM, AND PROGRAM FOR AN ADAPTOR TO READ AND WRITE TO SYSTEM MEMORY - Provided are a method, system, and program for an adaptor to read and write to system memory. A plurality of blocks of data to write to storage are received at an adaptor. The blocks of data are added to a buffer in the adaptor. A determination is made of pages in a memory device and I/O requests are generated to write the blocks in the buffer to the determined pages, wherein two I/O requests are generated to write to one block split between two pages in the memory device. The adaptor executes the generated I/O requests to write the blocks in the buffer to the determined pages in the memory device. | 06-24-2010 |
20100174867 | USING DIFFERENT ALGORITHMS TO DESTAGE DIFFERENT TYPES OF DATA FROM CACHE - Provided are a method, system, and article of manufacture for using different algorithms to destage different types of data from cache. A first destaging algorithm is used to destage a first type of data to a storage for a first duration. A second destaging algorithm is used to destage a second type of data to the storage for a second duration. | 07-08-2010 |
20100325376 | Apparatus and Method to Maintain Write Operation Atomicity Where a Data Transfer Operation Crosses a Data Storage Medium Track Boundary - A method to maintain write operation atomicity where a write operation crosses a data storage medium track boundary. The method supplies a storage controller comprising a host adapter, a processor, and a NVS. The primary host adapter receives from a host computer a write request and data. The method determines if the write request will cross a data storage medium track boundary. If the write request will cross a data storage medium track boundary, the method indicates to the host adapter that the write request comprises a two-track transfer, and writes the data to the primary NVS as the data is received. If the host computer fails prior to providing all the data to the storage controller, the method discards the data written to the NVS to ensure write operation atomicity. | 12-23-2010 |
20100332749 | WEAR LEVELING OF SOLID STATE DISKS DISTRIBUTED IN A PLURALITY OF REDUNDANT ARRAY OF INDEPENDENT DISK RANKS - A computational device allocates a plurality of solid state disks to a plurality of redundant array of independent disk (RAID) ranks, wherein a different solid state disk is absent in each RAID rank of the plurality of RAID ranks. The computational device determines at least one selected solid state disk from the plurality of solid state disks, wherein the at least one selected solid state disk is estimated to have undergone a greater amount of wear in comparison to other solid state disks in the plurality of solid state disks. Relatively more data and parity information is written to those RAID ranks in which the at least one selected solid state disk is absent in comparison to those RAID ranks in which the at least one selected solid state disk is present. | 12-30-2010 |
20120131293 | DATA ARCHIVING USING DATA COMPRESSION OF A FLASH COPY - Embodiments of the disclosure relate to archiving data in a storage system. An exemplary embodiment comprises making a flash copy of data in a source volume, compressing data in the flash copy wherein each track of data is compressed into a set of data pages, and storing the compressed data pages in a target volume. Data extents for the target volume may be allocated from a pool of compressed data extents. After each stride worth of data is compressed and stored in the target volume, data may be destaged to avoid destage penalties. Data from the target volume may be decompressed from a flash copy of the target volume in a reverse process to restore each data track, when the archived data is needed. Data may be compressed and uncompressed using a Lempel-Ziv-Welch process. | 05-24-2012 |
20120195524 | VALIDATING STORED COPIES OF DATA IMAGES TO LOAD INTO MEMORY - Provided are a method, system, and article of manufacture for validating stored copies of data images to load into memory. An image of data is maintained in a memory, wherein the image in the memory includes a generation number. The image in the memory is written to at least two copies of the image to storage locations in response to a first event, wherein the generation number for the image in the memory is stored in the storage locations having the copies of the image. A check generation number is stored in a storage location. The image is loaded from at least one of the copies of the image in one of the storage locations to the memory in response to a second event The generation number for the image loaded into the memory. The check generation number is incremented in response to the second event. The generation numbers for the copies of the image in the storage locations and the check generation number are used to validate the copies of the image. | 08-02-2012 |
20130219122 | MULTI-STAGE CACHE DIRECTORY AND VARIABLE CACHE-LINE SIZE FOR TIERED STORAGE ARCHITECTURES - A method in accordance with the invention includes providing first, second, and third storage tiers, wherein the first storage tier acts as a cache for the second storage tier, and the second storage tier acts as a cache for the third storage tier. The first storage tier uses a first cache line size corresponding to an extent size of the second storage tier. The second storage tier uses a second cache line size corresponding to an extent size of the third storage tier. The second cache line size is significantly larger than the first cache line size. The method further maintains, in the first storage tier, a first cache directory indicating which extents from the second storage tier are cached in the first storage tier, and a second cache directory indicating which extents from the third storage tier are cached in the second storage tier. | 08-22-2013 |
20140082231 | EFFICIENT PROCESSING OF CACHE SEGMENT WAITERS - For a plurality of input/output (I/O) operations waiting to assemble complete data tracks from data segments, a process, separate from a process responsible for the data assembly into the complete data tracks, is initiated for waking a predetermined number of the waiting I/O operations. A total number of I/O operations to be awoken at each of an iterated instance of the waking is limited. | 03-20-2014 |
20140082254 | RECOVERY FROM CACHE AND NVS OUT OF SYNC - For cache/data management in a computing storage environment, incoming data segments into a Non Volatile Storage (NVS) device of the computing storage environment are validated against a bitmap to determine if the incoming data segments are currently in use. Those of the incoming data segments determined to be currently in use are designated to the computing storage environment to protect data integrity. | 03-20-2014 |
20140082292 | EFFICIENT CACHE VOLUME SIT SCANS - A processor, operable in a computing storage environment, allocates portions of a Scatter Index Table (SIT) disproportionately between a larger portion dedicated for meta data tracks, and a smaller portion dedicated for user data tracks, and processes a storage operation through the disproportionately allocated portions of the SIT using an allocated number of Task Control Blocks (TCB). | 03-20-2014 |
20140082296 | DEFERRED RE-MRU OPERATIONS TO REDUCE LOCK CONTENTION - Data operations, requiring a lock, are batched into a set of operations to be performed on a per-core basis. A global lock for the set of operations is periodically acquired, the set of operations is performed, and the global lock is freed so as to avoid excessive duty cycling of lock and unlock operations in the computing storage environment. | 03-20-2014 |
20140082629 | PREFERENTIAL CPU UTILIZATION FOR TASKS - A set of like tasks to be performed is organized into a first group. Upon a determined imbalance between dispatch queue depths greater than a predetermined threshold, the set of like tasks is reassigned to an additional group. | 03-20-2014 |
20140304548 | INTELLIGENT AND EFFICIENT RAID REBUILD TECHNIQUE - A method for servicing a redundant array of independent storage drives (i.e., RAID) includes performing a service call on the RAID by performing the following steps: (1) determining whether the RAID includes one or more consumed spare storage drives; (2) in the event the RAID includes one or more consumed spare storage drives, physically replacing the one or more consumed spare storage drive with one or more non-consumed spare storage drives; and (3) initiating a copy process that copies data from a storage drive that is predicted to fail to a non-consumed spare storage drive associated with the RAID. The service call may then be terminated. After the service call is terminated, the method waits for an indication that a number of non-consumed spare storage drives in the RAID has fallen below a selected threshold. A corresponding apparatus and computer program product are also disclosed. | 10-09-2014 |