公开(公告)号：US20090234984A1

公开(公告)日：2009-09-17

申请号：US12048138

申请日：2008-03-13

申请人： Shiva Chaitanya ,  Karan Gupta ,  Madhukar R. Korupolu ,  Prasenjit Sarkar

发明人： Shiva Chaitanya ,  Karan Gupta ,  Madhukar R. Korupolu ,  Prasenjit Sarkar

IPC分类号： G06F13/00

CPC分类号： G06F13/385 ,  G06F3/0601 ,  G06F2003/0697 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/1031

摘要： 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.

摘要翻译： 提供了一种通过连接网络通过多个端口连接到多个主机的存储区域网络子系统中的数据流量管理的方法和系统。 流量管理涉及每个端口，基于分配给该端口的一个或多个主机的工作负载来确定端口的输入/输出（IO）流量利用负载; 并检测端口是否处于利用率过载。 然后，在检测到端口利用过载时，通过调整存储子系统中的超载端口和一个或多个其他端口的流量利用率来管理端口流量，以减少超载端口的流量利用。

公开(公告)号：US08682850B2

公开(公告)日：2014-03-25

申请号：US12137400

申请日：2008-06-11

申请人： Scott J. Colbeck ,  Madhukar R. Korupolu

发明人： Scott J. Colbeck ,  Madhukar R. Korupolu

IPC分类号： G06F7/00 ,  G06F17/00 ,  G06F17/30

CPC分类号： G06F17/30067

摘要： 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.

摘要翻译： 提供了一种方法和装置，用于通过根据存储媒体设备的当前负载和性能度量优先选择要保留的主副本来增强重复数据删除的影响。 计算机系统配置为将所识别的数据副本作为输入，并评估其在存储设备中的位置，以确定将所识别的副本之一保留为主副本以及如果需要可选地分配新位置的累积影响。 一旦指定了主副本，剩余​​的已识别的副本将从存储中删除。

公开(公告)号：US08214842B2

公开(公告)日：2012-07-03

申请号：US12394393

申请日：2009-02-27

申请人： Stefan Jaquet ,  Madhukar R. Korupolu

发明人： Stefan Jaquet ,  Madhukar R. Korupolu

IPC分类号： G06F9/46 ,  G06F3/00 ,  G06F3/048

CPC分类号： G06F3/04812 ,  G06F3/04817 ,  G06F9/5016 ,  H04L47/70 ,  H04L67/1097 ,  H04L67/2842

摘要： 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.

摘要翻译： 提供了一种在使用处理器与存储器件通信的数据存储系统中用于以可视化为中心的基于性能的卷分配的方法，系统和计算机程序产品。 生成代表数据存储系统中的存储组件的全局层次的统一资源图形，包括多个存储控制器中的每一个。 统一资源图包括与多个存储控制器内部的多个节点中的每一个对应的公共根节点和多个子树节点。 公共根节点和多个子树节点以自顶向下的方向排序。 基于输入来执行通过由统一资源图表示的至少一个存储组件的图形操纵来对现有的或新的工作负载量进行可扩展的卷规定。

公开(公告)号：US20110161617A1

公开(公告)日：2011-06-30

申请号：US13043247

申请日：2011-03-08

申请人： Bhuvan Bamba ,  Madhukar R. Korupolu

发明人： Bhuvan Bamba ,  Madhukar R. Korupolu

IPC分类号： G06F12/02

CPC分类号： G06F9/5083 ,  G06F9/5016

摘要： 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.

摘要翻译： 公开了可应用于大型存储控制器集合中的可扩展的基于性能的卷分配技术。 分析表示多个组件层中的存储系统的互连组件的多个节点的全局资源树，以产生每个节点的间隙值（例如，自底向上估计）。 每个节点的间隙值是可以在该节点的子树中分配的新工作负载的GB量的估计，而不超过该子树中任何节点的性能和空间界限。 进一步分析全局资源树的间隙值以生成存储系统的卷的有序分配列表（例如，自上而下的选择）。 卷可以按照分配列表的顺序应用于存储工作负载，并且间隙值和列表被更新。

公开(公告)号：US20090313312A1

公开(公告)日：2009-12-17

申请号：US12137400

申请日：2008-06-11

申请人： Scott J. Colbeck ,  Madhukar R. Korupolu

发明人： Scott J. Colbeck ,  Madhukar R. Korupolu

IPC分类号： G06F17/30

CPC分类号： G06F17/30067

摘要： 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.

摘要翻译： 提供了一种方法和装置，用于通过根据存储媒体设备的当前负载和性能度量优先选择要保留的主副本来增强重复数据删除的影响。 计算机系统配置为将所识别的数据副本作为输入，并评估其在存储设备中的位置，以确定将所识别的副本之一保留为主副本以及如果需要可选地分配新位置的累积影响。 一旦指定了主副本，剩余​​的已识别的副本将从存储中删除。

公开(公告)号：US20080288739A1

公开(公告)日：2008-11-20

申请号：US11750076

申请日：2007-05-17

申请人： Bhuvan Bamba ,  Madhukar R. Korupolu

发明人： Bhuvan Bamba ,  Madhukar R. Korupolu

IPC分类号： G06F12/00

CPC分类号： G06F9/5083 ,  G06F9/5016

摘要： 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.

摘要翻译： 公开了可应用于大型存储控制器集合中的可扩展的基于性能的卷分配技术。 分析表示存储系统的互连组件的多个节点的全局资源树，以产生每个节点的间隙值（例如，自底向上估计）。 每个节点的间隙值是可以在该节点的子树中分配的新工作负载的GB量的估计，而不超过该子树中任何节点的性能和空间界限。 进一步分析全局资源树的间隙值以生成存储系统的卷的有序分配列表（例如，自上而下的选择）。 卷可以按照分配列表的顺序应用于存储工作负载，并且间隙值和列表被更新。

公开(公告)号：US08321396B2

公开(公告)日：2012-11-27

申请号：US12192917

申请日：2008-08-15

申请人： Stephen Dill ,  Madhukar R. Korupolu ,  Andrew S. Tomkins

发明人： Stephen Dill ,  Madhukar R. Korupolu ,  Andrew S. Tomkins

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30719 ,  Y10S707/99932 ,  Y10S707/99933

摘要： 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.

摘要翻译： 逐行提取系统从爬行文档的标题元标签中检测潜在的标题集合，从潜在标题集合中选择候选标题，并使用所选择的位置从文档中提取副行信息 候选人标题。 该系统基于标题元标签构建潜在标题集。 该系统通过以潜在标题的长度的顺序评估潜在标题集来选择候选标题。 该系统通过使用所选择的候选标题的位置来提取来自文档的旁路信息来提取表示距离潜在标题的位置的最小距离内的日期，名称或源的字符串。

公开(公告)号：US08140538B2

公开(公告)日：2012-03-20

申请号：US12104711

申请日：2008-04-17

申请人： Madhukar R. Korupolu ,  Soumyadeb Mitra

发明人： Madhukar R. Korupolu ,  Soumyadeb Mitra

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30902

摘要： 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.

摘要翻译： 基于用于关键字搜索查询的文档访问的依从性和存储系统的数据缓存方法基于用户关键词查询的文档信息检索相关性度量和每个查询的频率，计算每个数据文档的值。 这些值适用于更改查询频率和流行度。 然后从缓存中选择和排除文档可以基于背包解决方案的值。 为每个查询计算权重，使得最近更频繁的查询获得更高的权重。 信息检索度量用于测量查询的文档的相关性。 对所有查询的查询权重进行信息检索度量的加权和。

公开(公告)号：US20110208941A1

公开(公告)日：2011-08-25

申请号：US12709742

申请日：2010-02-22

申请人： Binny S. Gill ,  Madhukar R. Korupolu

发明人： Binny S. Gill ,  Madhukar R. Korupolu

IPC分类号： G06F12/02

CPC分类号： G06F3/0605 ,  G06F3/06 ,  G06F3/0631 ,  G06F3/0689 ,  G06F9/50

摘要： 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.

摘要翻译： 公开了可应用于大型存储控制器集合中的可扩展的基于性能的卷分配技术。 分析表示存储系统的互连组件的多个节点的全局资源树，以在特定时间段内产生每个节点的间隙值。 每个节点的间隙值是可以在该节点的子树中分配的附加或增加的工作量的量的估计，而不超过特定时间段内该子树中的任何节点的性能和空间界限。 进一步分析全局资源树的间隙值以生成存储系统的卷的有序分配列表。

公开(公告)号：US20100218013A1

公开(公告)日：2010-08-26

申请号：US12393002

申请日：2009-02-25

申请人： Binny S. Gill ,  Madhukar R. Korupolu

发明人： Binny S. Gill ,  Madhukar R. Korupolu

IPC分类号： G06F1/32 ,  G06Q30/00 ,  G06Q10/00

CPC分类号： G06F1/3221 ,  G06Q30/04 ,  G06Q50/06 ,  Y02D10/154

摘要： 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.

摘要翻译： 本发明提供了一种用于基于时间的存储访问的方法和系统，所述方法包括将多个存储卷与可以被访问的特定时间段相关联，基于存储卷的访问时间段来调整用户费用， 基于多个存储卷的访问周期，系统中可用存储箱中的存储卷的存储卷，其中具有重叠或类似的访问周期的卷可能被打包到相同的存储仓中，并且将存储仓切换到关闭或 在不需要放置在存储箱中的存储容量的期间降低功率状态，以减少功耗。