Patent application number | Description | Published |
20090193140 | SYSTEM AND METHOD FOR THROTTLING HOST THROUGHPUT - A method for throttling host throughput in a computer storage subsystem is provided. The host throughput is compared to a throughput limit for a predetermined time period. If the host throughput exceeds the throughput limit during the predetermined time period, an input/output (I/O) delay is set equal to the remainder of the predetermined time period, and the delay is implemented for an associated storage device of the computer storage subsystem. | 07-30-2009 |
20090327469 | Method for Controlling Host Throughput to a Computer Storage Subsystem - A method for controlling the throughput in a communications channel between a host and its storage subsystem is disclosed. A determination is made whether or not a total throughput value is greater than a predetermined maximum throughput value. If the total throughput value is greater than the predetermined maximum throughput value, a delay is applied to the communications channel. If the total throughput value is not greater than the predetermined maximum throughput value, another determination is made whether or not one time period has completed. If one time period has completed, a total throughput value and an exponential moving average (EMA) throughput value of the communications channel is retrieved, a new EMA throughput value is generated based on the total throughput value and the EMA throughput value, and adjusting the total throughput value based on whether or not the new throughput value is greater than a predetermined maximum throughput value. | 12-31-2009 |
20110107024 | EXTENDED LOGICAL WORM DATA INTEGRITY PROTECTION - A data storage system stores logical data object(s), each identified by a logical identifier. A control is configured to assign a unique WORM (Write Once Read Many) identifier to the logical data object, and stores the unique WORM identifier as associated with the logical identifier, in a database maintained by the control so as to be persistent. Data storage is configured to write the logical data object with a header with the unique WORM identifier. The control, in order to allow the logical data object to be accessed externally to the control, requires matching the unique WORM identifier in the header of a logical data object to the unique WORM identifier of the persistent database for the logical object. The unique WORM identifier is formed of a checksum hash value related to nonce fields comprising at least the logical identifier of the logical data object, an incrementing token, and a time stamp. | 05-05-2011 |
20110107045 | HYBRID STORAGE DATA MIGRATION BY SELECTIVE DATA REMOVAL - A hybrid data storage system is one which has data storage clusters of different types. In a hybrid data storage system, at least one first data storage cluster is configured to store data and has high data storage capacity; and at least one second data storage cluster is configured to store data and has lower data storage capacity than the first cluster. The data is initially replicated and stored by at least one first and at least one second data storage cluster. The method identifies a portion of the stored initially replicated data of at least one second data storage cluster as “pinned”; continues to store the pinned initially replicated data; and selectively removes non-pinned initially replicated data from the second data storage cluster(s) to account for the capacity difference. | 05-05-2011 |
20110107140 | SELECTIVE WRITE PROTECT FOR DISASTER RECOVERY TESTING - Various method, system, and computer program product embodiments for implementing selective write-protect by a processor in a data storage system within a plurality of redundant storage systems for disaster recovery testing are provided. In one such embodiment, a write-protect state is initiated within at least one of the plurality of redundant storage systems. An available plurality of categories, including at least one write-protect exclusion category, is configured within a management interface of the data storage system, such that during the disaster recovery testing a storage volume categorized in the write-protect exclusion category is excluded from write protection. | 05-05-2011 |
20110145517 | DYNAMIC REUSE AND RECONFIGURATION OF LOGICAL DATA OBJECTS IN A VIRTUAL TAPE SYSTEM - An embodiment of the invention comprises a virtual tape system supporting at least one Write Once Read Many (WORM) logical tape and at least one read-write logical tape, comprising a processor configured to a first task and/or a second task. The first task initializes a new logical data object from a single pool of at least two logical data objects, with the new logical data object bound with a member of a media type group consisting of a WORM data object or a read-write data object. The second task reuses one of the logical data objects without manual ejection and reinsertion. The reuse may include the processor configured to cycle the logical data object through a scratch pool as a selected scratch logical data object and mount the selected scratch logical data object with a write from beginning of tape command to bind at least one data attribute to the WORM data object. | 06-16-2011 |
20110276754 | PARTIAL VOLUME ACCESS IN A PHYSICAL STACKED VOLUME - In one embodiment, a VTS system includes a tape volume cache, a storage drive for interacting with sequential access storage media; logic for receiving a mount request to access host data record(s) stored on a storage medium, the mount request including a virtual volume identifier of a logical volume and a logical block identifier of the first requested host data record therein; logic for issuing a locate command to position the sequential access storage medium to about a physical block in the logical volume having at least a portion of the requested host data record(s) therein based on the virtual volume identifier and the logical block identifier; logic for creating and supporting a partial virtual volume in the tape volume cache; and logic for copying at least the physical block to the partial virtual volume. Other systems, methods, and computer program products are also described, according to other embodiments. | 11-10-2011 |
20110276756 | MAPPING LOCATIONS OF LOGICAL VOLUME RECORDS ON A PHYSICAL STACKED VOLUME - In one embodiment, a method for accessing host data records stored in a VTS system includes receiving a mount request to access at least one host data record, determining a SLBID corresponding to the requested host data records, determining a PBID that corresponds to the SLBID, accessing a physical block on a sequential access storage medium corresponding to the PBID, and outputting at least the physical block corresponding to the PBID without outputting an entire logical volume that the physical block is stored to. According to another embodiment, a VTS system includes random access storage, sequential access storage, support for at least one virtual volume, a storage manager having logic for determining a PBID that corresponds to a SLBID, and logic for copying a portion of a logical volume from the sequential access storage to the random access storage without copying the entire logical volume. Other embodiments are disclosed also. | 11-10-2011 |
20110320679 | OFFLOADING VOLUME SPACE RECLAMATION OPERATIONS TO VIRTUAL TAPE SYSTEMS - A method for offloading volume space reclamation operations to virtual tape systems is disclosed herein. In certain embodiments, such a method includes writing instruction information to a virtual tape system for use in performing a reclamation operation on a source virtual tape volume. The instruction information identifies the source virtual tape volume as well as valid objects in the source virtual tape volume. The virtual tape system then transforms the source virtual tape volume by retaining valid objects in the source virtual tape volume, removing invalid objects in the source virtual tape volume, and updating metadata associated with the source virtual tape volume to reflect changes made thereto. This generates an updated source virtual tape volume of reduced size. A corresponding computer program product and system are also disclosed and claimed herein. | 12-29-2011 |
20120239876 | MAPPING LOCATIONS OF LOGICAL VOLUME RECORDS ON A PHYSICAL STACKED VOLUME - In one embodiment, a method for accessing host data records stored in a VTS system includes receiving a mount request to access at least one host data record, determining a SLBID corresponding to the requested host data records, determining a PBID that corresponds to the SLBID, accessing a physical block on a sequential access storage medium corresponding to the PBID, and outputting at least the physical block corresponding to the PBID without outputting an entire logical volume that the physical block is stored to. According to another embodiment, a VTS system includes random access storage, sequential access storage, support for at least one virtual volume, a storage manager having logic for determining a PBID that corresponds to a SLBID, and logic for copying a portion of a logical volume from the sequential access storage to the random access storage without copying the entire logical volume. Other embodiments are disclosed also. | 09-20-2012 |
20120239891 | DYNAMIC REUSE AND RECONFIGURATION OF LOGICAL DATA OBJECTS IN A VIRTUAL TAPE SYSTEM - A method in one embodiment for operating a virtual server supporting at least one Write Once Read Many (WORM) logical data object and at least one read-write logical object includes initializing a logical data object from a common pool of the logical data objects, the logical data object bound with a member of a media type group, the member of the media type group comprising a WORM logical data object and a read-write logical data object; and reusing one of the logical data objects as the member of the media type group without ejection and reinsertion by mounting the logical data object with a write from beginning of logical data object to bind at least one data attribute to the member of the media type group to replace any previous attribute and data associated with the logical data object. | 09-20-2012 |
20120284467 | EXTENDED LOGICAL WORM DATA INTEGRITY PROTECTION WITH UNIQUE WORM IDENTIFIER IN HEADER AND DATABASE - A data storage system stores logical data object(s), each identified by a logical identifier. A control is configured to assign a unique WORM (Write Once Read Many) identifier to the logical data object, and stores the unique WORM identifier as associated with the logical identifier, in a database maintained by the control so as to be persistent. Data storage is configured to write the logical data object with a header with the unique WORM identifier. The control, in order to allow the logical data object to be accessed externally to the control, requires matching the unique WORM identifier in the header of a logical data object to the unique WORM identifier of the persistent database for the logical object. The unique WORM identifier is formed of a checksum hash value related to nonce fields comprising at least the logical identifier of the logical data object, and an incrementing token. | 11-08-2012 |
20130290625 | MAPPING LOCATIONS OF LOGICAL VOLUME RECORDS ON A PHYSICAL STACKED VOLUME - A system, method and computer program product for accessing host data records stored in a virtual tape storage (VTS) system. The computer program product includes a computer readable storage medium having computer readable program code embodied therewith. The computer readable program code includes computer readable program code configured to receive a mount request to access at least one host data record in a VTS system; computer readable program code configured to determine a starting logical block ID (SLBID) corresponding to the at least one requested host data record; computer readable program code configured to determine a physical block ID (PBID) that corresponds to the SLBID; computer readable program code configured to access a physical block on a magnetic tape medium corresponding to the PBID; and computer readable program code configured to output at least the physical block without outputting an entire logical volume that the physical block is stored to. | 10-31-2013 |
20140344540 | CLUSTER FAMILIES FOR CLUSTER SELECTION AND COOPERATIVE REPLICATION - Cluster families for cluster selection and cooperative replication are created. The clusters are grouped into family members of a cluster family base on their relationships and roles. Members of the cluster family determine which family member is in the best position to obtain replicated information and become cumulatively consistent within their cluster family. Once the cluster family becomes cumulatively consistent, the data is shared within the cluster family so that all copies within the cluster family are consistent. Each family member in the family replicates 1/Nth volumes and N represents a total number of cluster family members in the family. | 11-20-2014 |
20150089169 | DYNAMIC REUSE AND RECONFIGURATION OF LOGICAL DATA OBJECTS IN A VIRTUAL TAPE SYSTEM - A method according to one embodiment includes selecting, by a processor, one of a WORM logical data object and a read-write logical data object for reuse as a new WORM logical data object, said processor maintaining data attributes bound to said selected logical data object until it is determined that said selected logical data object is available for reuse. At least one temporary data attribute is assigned to said selected logical data object while maintaining said data attributes bound to said selected logical data object The selected logical data object is mounted and a write command to beginning of logical data object is received to bind at least one data attribute to said selected logical data object to replace data attributes and data associated with said selected logical data object to reuse said selected logical data object as said new WORM logical data object. | 03-26-2015 |
Patent application number | Description | Published |
20090055582 | SEGMENTATION OF LOGICAL VOLUMES - Provided are a method, system, and article of manufacture, wherein a storage manager application implemented in a first computational device maintains a virtual logical volume that represents a plurality of segments of a linear storage medium of a secondary storage, wherein the virtual logical volume and the plurality of segments are created by the storage manager application. A request for data is received at the first computational device, from a second computational device. The storage manager application moves selected segments of the plurality of segments from the linear storage medium of the secondary storage to a cache storage, in anticipation that the requested data is included in the selected segments that are moved from the linear storage medium of the secondary storage to the cache storage. | 02-26-2009 |
20090063411 | PROPAGATION OF UPDATES FOR ATTRIBUTES OF A STORAGE OBJECT FROM AN OWNER NODE OF THE STORAGE OBJECT TO OTHER NODES - Local versions of attributes of a storage object are maintained at a plurality of nodes, wherein a first attribute designates a first node of the plurality of nodes as an owner node for the storage object, and wherein a second attribute includes information to resolve validity of ownership of the storage object among the plurality of nodes. The owner node communicates changes to be made to the local versions of the attributes at other nodes of the plurality of nodes. A second node of the plurality of nodes requests ownership of the storage object. The first attribute is updated to designate the second node of the plurality of nodes as the owner node, in response to determining from the second attribute that the validity of ownership of the storage object allows the second node to inherit ownership of the storage object once the first node surrenders ownership of the storage object. | 03-05-2009 |
20090063487 | SECURING TRANSFER OF OWNERSHIP OF A STORAGE OBJECT FROM AN UNAVAILABLE OWNER NODE TO ANOTHER NODE - Provided are a method, system, and article of manufacture that maintain a plurality of nodes coupled over a network, wherein a first node of the plurality of nodes initially owns a plurality of storage objects accessible via the network. A serialization lock is maintained in association with the plurality of storage objects, wherein the first node becomes unavailable. A second node of the plurality of nodes determines that the second node is to preemptively assume ownership of a selected storage object of the plurality of storage objects initially owned by the first node that has become unavailable. The second node acquires the serialization lock. The second node secures ownership of the selected storage object, subsequent to acquiring the serialization lock. | 03-05-2009 |
20090063582 | MAINTAINING MESSAGE VERSIONS AT NODES IN A NETWORK - Provided are a method, system, and article of manufacture for maintaining message versions at nodes in a network. The nodes in the network maintain version information of nodes in the network. The version information for the nodes indicates a message version number of messages supported at the node. The nodes supporting one message version number can receive messages having that message version number. The nodes use the version information to determine whether there is at least one common message version number among the nodes The nodes supporting the at least one common message version number negotiate to join a quorum of the nodes having the at least one common message version number. | 03-05-2009 |
20090063668 | TRANSFER OF OWNERSHIP OF A STORAGE OBJECT IN RESPONSE TO AN ORIGINAL OWNER NODE BECOMING AVAILABLE AFTER A PERIOD OF UNAVAILABILITY - Provided are a method, system, and article of manufacture, wherein a plurality of nodes coupled over a network are maintained, wherein a first node of the plurality of nodes initially owns a plurality of storage objects accessible via the network. A second node preemptively takes ownership of a selected storage object of the plurality of storage objects, in response to the first node becoming unavailable, wherein other nodes of the plurality of nodes can request ownership of the selected storage object while the first node is unavailable. A determination is made that the first node that originally owned the selected storage object has become available after a period of unavailability. A determination is made of the current owner node of the selected storage object, wherein the current owner node is one of the second node and the other nodes. The selected storage object is updated at the first node by the current owner node of the selected storage object, prior to allowing the first node to act on or assume ownership of the selected storage object. | 03-05-2009 |
20100082840 | USING LINK SEND AND RECEIVE INFORMATION TO SELECT ONE OF MULTIPLE LINKS TO USE TO TRANSFER DATA FOR SEND AND RECEIVE OPERATIONS - Provided are a method, system, and article of manufacture for using link send and receive information to select one of multiple links to use to transfer data for send and receive operations. Link information for a plurality of links to at least one target node indicates for each link a send throughput for sending data, a receive throughput for received data, a state of the link indicating whether the link is online, offline or degraded. A send operation is processed to transfer data to a receiving node comprising one of the target nodes. A determination is made of the states of the links to the receiving node in response to the send operation. The send throughput of the links having the online state is processed to select one of the links to the receiving node in response to determining that more than one of the links has the online state. The data of the send operation is sent using the selected link to the receiving node. A retrieve operation to access data from a sending node comprising one of the target nodes is processed. A determination is made of the state of the links to the sending node in response to the retrieve operation. The receive throughput is processed to select one of the links having the online state to the sending node in response to determining that more than one of the links has the online state. The data of the receive operation is received using the selected link to the sending node. | 04-01-2010 |
20100180147 | APPARATUS, SYSTEM, AND METHOD FOR LINK MAINTENANCE - An apparatus, system, and method are disclosed for link maintenance. A plurality of state machines operate a plurality of first links between data management nodes with each first link in an online state. A transition module transitions the plurality of first links from the online state to a degraded state and from the online state to an offline pending state in response to an offline request. The transition module further transitions the plurality of first links from the degraded state to an online pending state when a degraded link time interval expires and from the offline pending state to an offline state if all pending tasks on the plurality of first links are completed. The transition module further transitions the plurality of first links from the online pending state to the online state if each first link is validated. | 07-15-2010 |
20110145497 | Cluster Families for Cluster Selection and Cooperative Replication - An apparatus, system, and method are disclosed to create cluster families for cluster selection and cooperative replication. The clusters are grouped into family members of a cluster family base on their relationships and roles. Members of the cluster family determine which family member is in the best position to obtain replicated information and become cumulatively consistent within their cluster family. Once the cluster family becomes cumulatively consistent, the data is shared within the cluster family so that all copies within the cluster family are consistent. | 06-16-2011 |
20120290805 | CLUSTER FAMILIES FOR CLUSTER SELECTION AND COOPERATIVE REPLICATION - An apparatus, system, and method are disclosed for cooperative replication of multiple clusters. A copy request to copy a volume into a first cluster is received. A determination is made whether the first cluster is a family member of a cluster family. If the first cluster is a family member of the cluster family, a determination is made whether another family member already completed copying the volume. If another family member has not already copied the volume, the first cluster is designated to inherit the copy request. The copy request is executed and the volume is cooperative replicated into the cluster family. Cumulative consistency is achieved within the cluster family. The volume is shared within the cluster family so that all copies of the volume within the cluster family are consistent. | 11-15-2012 |