Abstract: A method of data caching for compliance and storage systems that provide keyword search query based access to documents computes a value for each data document based on a document information-retrieval relevancy metric for user keyword queries and a recency, frequency of each query. The values are adapted to changing query frequencies and popularities. Then selecting and evicting documents from a cache can be based on the values according to a knapsack solution. A weight is computed for each query such that recent, more frequent queries get a higher weight. A information-retrieval metric is used for measuring a relevancy of a document for a query. A weighted sum is taken of the information-retrieval metric times a query weight over all queries.

Abstract: A scalable, performance-based, volume allocation technique that can be applied in large storage controller collections is disclosed. A global resource tree of multiple nodes representing interconnected components of a storage system is analyzed to yield gap values for each node for a specific time period. The gap value for each node is an estimate of the amount of the additional or increased workload that can be allocated in the subtree of that node without exceeding the performance and space bounds at any of the nodes in that subtree for the specific time period. The gap values of the global resource tree are further analyzed to generate an ordered allocation list of the volumes of the storage system.

Abstract: A scalable, performance-based, volume allocation technique that can be applied in large storage controller collections is disclosed. A global resource tree of multiple nodes representing interconnected components of a storage system in a plurality of component layers is analyzed to yield gap values for each node (e.g., a bottom-up estimation). The gap value for each node is an estimate of the amount in GB of the new workload that can be allocated in the subtree of that node without exceeding the performance and space bounds at any of the nodes in that subtree. The gap values of the global resource tree are further analyzed to generate an ordered allocation list of the volumes of the storage system (e.g., a top-down selection). The volumes may be applied to a storage workload in the order of the allocation list and the gap values and list are updated.

Abstract: A method and system for data traffic management in a storage area network subsystem connected to multiple hosts via plural ports through a connection network is provided. Traffic management involves, for each port, determining input/output (IO) traffic utilization load of the port based on workloads from one or more hosts assigned to that port; and detecting if a port is in utilization overload. Then, upon detecting a port utilization overload, port traffic is managed by adjusting traffic utilization of the overloaded port and one or more other ports in the storage subsystem, to reduce traffic utilization of the overloaded port.

Abstract: A scalable, performance-based, volume allocation technique that can be applied in large storage controller collections is disclosed. A global resource tree of multiple nodes representing interconnected components of a storage system is analyzed to yield gap values for each node (e.g., a bottom-up estimation). The gap value for each node is an estimate of the amount in GB of the new workload that can be allocated in the subtree of that node without exceeding the performance and space bounds at any of the nodes in that subtree. The gap values of the global resource tree are further analyzed to generate an ordered allocation list of the volumes of the storage system (e.g., a top-down selection). The volumes may be applied to a storage workload in the order of the allocation list and the gap values and list are updated.

Abstract: Server consolidation using virtual machine resource tradeoffs, is provided. One implementation involves assigning a virtual machine to a target physical server based on a plurality of virtualization parameters for maximizing utility of a plurality of virtual machines and physical servers. The assigning performs resource allocation for the virtual machine based on capabilities of the target physical server and a plurality of virtual machine resource requirements. Virtualization parameters include a reservation parameter (min) representing a minimum resources required for a VM, a limit parameter (max) representing a maximum resources allowable for the VM, and a weight parameter (shares) representing a share of spare resources for the VM.

Abstract: Techniques are disclosed for optimizing volume allocation on storage controllers that may have varying degrees of control over directing storage on ranks of pools attached storage components. A performance-based volume allocation algorithm can optimize allocation for such various controllers in a smooth, uniform manner allowing changes from one degree of control to another without incurring costly code changes and re-architecting costs. Where control is not available a surrogate set of possible ranks where the allocation could be made is developed and employed to calculate an adjusted utilization cost. In turn, the adjusted utilization cost is used to calculate a space limit value limited by a target performance threshold.

Abstract: A method, system, and computer program product for visualization-centric performance-based volume allocation in a data storage system using a processor in communication with a memory device is provided. A unified resource graph representative of a global hierarchy of storage components in the data storage system, including each of a plurality of storage controllers, is generated. The unified resource graph includes a common root node and a plurality of subtree nodes corresponding to each of a plurality of nodes internal to the plurality of storage controllers. The common root node and the plurality of subtree nodes are ordered in a top-down orientation. Scalable volume provisioning of an existing or new workload amount by graphical manipulation of at least one of the storage components represented by the unified resource graph is performed based on an input.

Abstract: The invention provides a method and system for time-based storage access, the method includes associating a plurality of storage volumes with specific periods of time during which they can be accessed, adjusting user fees based on access time periods of storage volumes, packing the plurality of storage volumes in available storage bins in the system based on periods of access for the plurality of storage volumes, wherein volumes with overlapping or similar periods of access are packed into a same storage bin if possible, and switching a storage bin to off or a reduced power state during periods when the storage volumes placed in the storage bin are not required, to reduce power consumption.

Abstract: The invention provides a method and system for continuous optimization of a data center. The method includes monitoring loads of storage modules, server modules and switch modules in the data center, detecting an overload condition upon a load exceeding a load threshold, combining server and storage virtualization to address storage overloads by planning allocation migration between the storage modules, to address server overloads by planning allocation migration between the server modules, to address switch overloads by planning allocation migration mix between server modules and storage modules for overload reduction, and orchestrating the planned allocation migration to reduce the overload condition in the data center.

Abstract: A date querying system processes free-form text in documents to identify and locate some or all of the dates in the documents using extended regular expression matching to capture various date formats. The system packages a canonicalized format of each identified date to support various types of queries such as, for example, specific date querying, hierarchical date querying, range date querying, proximity queries comprising a date and any keywords, and any combination of types of queries. The system scans a document to identify the various format dates occurring in the document, disambiguates the resulting occurrences of dates, and canonicalizes the dates according to one or more predetermined formats.

Abstract: A method and apparatus are provided for enhancing the impact of data de-duplication by preferential selection of the master copy to be retained based on current loads and performance metrics of the storage media devices. The computer system is configured to take as input the identified duplicate copies of data and evaluating their locations in storage devices to determine the cumulative affects of retaining one of the identified duplicate copies as a master copy and optionally allocating a new location if needed. Once a master copy has been designated, the remaining identified duplicate copies are removed from storage.

Abstract: A method of data caching for compliance and storage systems that provide keyword search query based access to documents computes a value for each data document based on a document information-retrieval relevancy metric for user keyword queries and a recency, frequency of each query. The values are adapted to changing query frequencies and popularities. Then selecting and evicting documents from a cache can be based on the values according to a knapsack solution. A weight is computed for each query such that recent, more frequent queries get a higher weight. A information-retrieval metric is used for measuring a relevancy of a document for a query. A weighted sum is taken of the information-retrieval metric times a query weight over all queries.

Abstract: A method and system for data traffic management in a storage area network subsystem connected to multiple hosts via plural ports through a connection network is provided. Traffic management involves, for each port, determining input/output (IO) traffic utilization load of the port based on workloads from one or more hosts assigned to that port; and detecting if a port is in utilization overload. Then, upon detecting a port utilization overload, port traffic is managed by adjusting traffic utilization of the overloaded port and one or more other ports in the storage subsystem, to reduce traffic utilization of the overloaded port.

Abstract: A method and system selecting a target physical machine for a virtual machine (VM) migration is provided. Selecting a target physical machine for a VM migration involves determining storage volume connectivity and spare path capacity of one or more candidate physical machines, and preferentially selecting among the candidate physical machines a migration target with storage volume connectivity and spare path capacity to satisfy storage volume access requirements of the VM.

Abstract: A method and system for integrated server-storage deployment planning for virtual appliances is provided. One implementation involves determining a performance cost in deploying the virtual appliance to different pairings of candidate host and storage subsystems. A host and storage subsystem pair is preferentially selected among the candidate pairings, a pairing of a host and storage subsystem with certain performance cost to satisfy performance requirements of the virtual appliance. Deployment planning may further involve deploying a virtual appliance on one or more appropriate spatially proximate hosts and storage subsystems that exhibit certain preferable connectivity and path capacity to satisfy the performance requirements of the virtual appliance.

Abstract: A system efficiently and proactively assesses the impact of user's actions on a network storage system. The system generally operates on a storage area network that includes a database represented by states and policies, before the user action is executed. The system comprises a storage monitor that captures a snapshot of the database states. An impact analysis module of the system then applies a user action to the snapshot; and further selectively applies at least some of the policies to the snapshot. The impact analysis module simulates the user action on the snapshot without applying actually changes to the database, and further analyzes whether the simulated user action violates at least one applied policy. The system takes the appropriate action based on the result of the analysis.

Abstract: In a storage area network, the storage pool is the principal component that determines the storage quality of service in the network. The proposed system's goal is to balance the utilizations of the storage pools using a suitable metric (e.g., standard deviation). The utilization of a storage pool is determined by the same components that are part of the composition of the storage pool: the disks and the storage systems. This system then gathers performance information about all the storage pools and applies the described method to determine a sequence of resource-reallocations so that a well-balanced utilization of pools is achieved.

Abstract: Techniques are disclosed for optimizing volume allocation on storage controllers that may have varying degrees of control over directing storage on ranks of pools attached storage components. A performance-based volume allocation algorithm can optimize allocation for such various controllers in a smooth, uniform manner allowing changes from one degree of control to another without incurring costly code changes and re-architecting costs. Where control is not available a surrogate set of possible ranks where the allocation could be made is developed and employed to calculate an adjusted utilization cost. In turn, the adjusted utilization cost is used to calculate a space limit value limited by a target performance threshold.

Abstract: A by-line extraction system detects a set of potential headlines from a title meta-tag of a crawled document, selects a candidate headline from the set of potential headlines, and extracts the by-line information from the document using the location of the selected candidate headline. The system constructs the set of potential headlines based on the title meta-tag. The system selects a candidate headline by evaluating the set of potential headlines in order of the lengths of the potential headlines. The system extracts the by-line information from the document by using the location of the selected candidate headline to extract a string representing a date, a name, or a source located within a minimum distance from the location of the potential headline.