Patent application number | Description | Published |
20140095699 | EVENT SUPPRESSION METHOD AND SYSTEM - A method and system for managing and dynamically suppressing event notification is provided. The method and system receives an indication of an event from a storage environment to be processed by a support system according to a set of default delivery parameters. Next, the method and system determines if one or more event specific delivery parameters have been associated with the event. If this is the case, then the method and system modifies the default delivery parameters for the information associated with the event according to the one or more event specific delivery parameters. These event specific delivery parameters are also used to determine when to transmit a notification of the event to the support system. The dynamic suppression of events combines events gathered into an event log together into a set of one or more recurring events. From these events, the method and system then identifies a high frequency subset as one or more recurring events considered to occur at a higher frequency compared with a low frequency subset having one or more recurring events that occur at a lower frequency. Based on this information gathered, the method and system then eliminates a portion of the events in the high frequency subset until the frequency of events in the high frequency subset approximates the frequency of events in the low frequency subset. | 04-03-2014 |
20140109014 | GRAPHICAL STORAGE SYSTEM VISUALIZATION, TIMELINE BASED EVENT VISUALIZATION, AND STORAGE SYSTEM CONFIGURATION VISUALIZATION - A method and system for visually displaying and navigating a computer storage system are disclosed. The storage system can be graphically browsed to select a particular entity in the storage system. A graphical timeline of events relating to the selected entity is displayed. Selecting an event from the timeline displays a graphical representation of the storage system at a time relating to the selected event or additional graphical detail about the selected event. Based on the selected event, configuration information for the entity in the storage system that experienced the event can be displayed and compared against the configuration of the entity at a different time or against a predefined template. | 04-17-2014 |
20140114932 | SELECTIVE DEDUPLICATION - Methods and apparatuses for performing selective deduplication in a storage system are introduced here. Techniques are provided for determining a probability of deduplication for a data object based on a characteristic of the data object and performing a deduplication operation on the data object in the storage system prior to the data object being stored in persistent storage of the storage system if the probability of deduplication for the data object has a specified relationship to a specified threshold. | 04-24-2014 |
20140114933 | MIGRATING DEDUPLICATED DATA - Methods and apparatuses for efficiently migrating deduplicated data are provided. In one example, a data management system includes a data storage volume, a memory including machine executable instructions, and a computer processor. The data storage volume includes data objects and free storage space. The computer processor executes the instructions to perform deduplication of the data objects and determine migration efficiency metrics for groups of the data objects. Determining the migration efficiency metrics includes determining, for each group, a relationship between the free storage space that will result if the group is migrated from the volume and the resources required to migrate the group from the volume. | 04-24-2014 |
20140122434 | SIMPLIFIED COPY OFFLOAD - Methods and apparatuses for performing simplified copy offload operations are provided. In one exemplary embodiment, a method includes creating a persistent point-in-time image of a data set of a source storage device in response to receiving a token request for a copy offload operation from a host. Creating the persistent point-in-time image includes generating pointers to data blocks of the data set, but does not include duplicating the data blocks. The method also includes transmitting a token that is a representation of the persistent point-in-time image to the host in response to the request. | 05-01-2014 |
20140122718 | LOCK STATE SYNCHRONIZATION FOR NON-DISRUPTIVE PERSISTENT OPERATION - Techniques for synchronization between data structures for original locks and mirror lock data structures are disclosed herein. The mirror lock data structures are being maintained during various scenarios including volume move and aggregate relocation, in order to preserve the non-disruptive persistent operation on storage initiated by clients. According to one embodiment, a storage node determines a plurality of data container locks to be synchronized to a partner node of the storage node and transfers metadata that indicates states of variables that represent the plurality of data container locks to the partner node in a batch. When a client initiates a data access operation that causes an attempt to modify a data container lock of the plurality of data container locks, the storage node sends a retry code to a client that prompts the client to retry the data access operation after a predetermined time period. | 05-01-2014 |
20140143286 | INTER-PROTOCOL COPY OFFLOAD - Methods and apparatuses for performing inter-protocol copy offload operations are provided. In one embodiment, a method includes receiving a request in a first interface protocol from a host device. The request is a request to copy a data set from a source data storage location to a destination data storage location. The request includes a token, representing the data set, to be copied that was created using a second interface protocol that is different from the first interface protocol. The method also includes transferring the data set, in response to receiving the request, from the source data storage location to the destination data storage location without transferring the data set to the host device. | 05-22-2014 |
20140156777 | DYNAMIC CACHING TECHNIQUE FOR ADAPTIVELY CONTROLLING DATA BLOCK COPIES IN A DISTRIBUTED DATA PROCESSING SYSTEM - A dynamic caching technique adaptively controls copies of data blocks stored within caches (“cached copies”) of a caching layer distributed among servers of a distributed data processing system. A cache coordinator of the distributed system implements the dynamic caching technique to increase the cached copies of the data blocks to improve processing performance of the servers. Alternatively, the technique may decrease the cached copies to reduce storage capacity of the servers. The technique may increase the cached copies when it detects local and/or remote cache bottleneck conditions at the servers, a data popularity condition at the servers, or a shared storage bottleneck condition at the storage system. Otherwise, the technique may decrease the cached copies at the servers. | 06-05-2014 |
20140164694 | DECOUPLED RELIABILITY GROUPS - Methods and apparatuses for updating members of a data storage reliability group are provided. In one exemplary method, a reliability group includes a data zone in a first storage node and a checksum zone in a second data storage node. The method includes updating a version counter associated with the data zone in response to destaging a data object from a staging area of the data zone to a store area of the data zone without synchronizing the destaging with the state of the checksum zone. The method further includes transmitting, from the data zone to the checksum zone, an update message indicating completion of the destaging of the data object, wherein the update message includes a current value of the version counter. | 06-12-2014 |
20140244643 | WORKLOAD IDENTIFICATION - An embodiment of the invention provides an apparatus and method for classifying a workload of a computing entity. In an embodiment, the computing entity samples a plurality of values for a plurality of parameters of the workload. Based on the plurality of values of each parameter, the computing entity determines a parameter from the plurality of parameters that the computing entity's response time is dependent on. Here, the computing entity's response time is indicative of a time required by the computing entity to respond to a service request from the workload. Further, based on the identified significant parameter, the computing entity classifies the workload of the computing entity by selecting a workload classification from a plurality of predefined workload classifications. | 08-28-2014 |