公开(公告)号：US20100306382A1

公开(公告)日：2010-12-02

申请号：US12476061

申请日：2009-06-01

申请人： Michael D. Cardosa ,  Sandeep Gopisetty ,  Madhukar R. Korupolu ,  Aameek Singh

发明人： Michael D. Cardosa ,  Sandeep Gopisetty ,  Madhukar R. Korupolu ,  Aameek Singh

IPC分类号： G06F15/173 ,  G06F9/455

CPC分类号： G06F9/5077 ,  G06F9/45541 ,  G06F9/45558 ,  G06F9/5038 ,  G06F9/5044 ,  G06F9/5094 ,  G06F2009/4557 ,  G06F2009/45595 ,  G06F2209/5014 ,  G06F2209/504 ,  Y02D10/22

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

摘要翻译： 提供了使用虚拟机资源权衡的服务器整合。 一个实现包括基于用于最大化多个虚拟机和物理服务器的效用的多个虚拟化参数将虚拟机分配给目标物理服务器。 该分配基于目标物理服务器的能力和多个虚拟机资源需求来执行虚拟机的资源分配。 虚拟化参数包括表示VM所需的最小资源的预留参数（min），表示VM允许的最大资源的限制参数（max）以及表示VM的备用资源份额的权重参数（共享）。

公开(公告)号：US20100211956A1

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

申请号：US12388404

申请日：2009-02-18

申请人： Sandeep Gopisetty ,  Madhukar R. Korupolu ,  Dushmanta Mohapatra ,  Seshashayee Sankarshana Murthy ,  Aameek Singh

发明人： Sandeep Gopisetty ,  Madhukar R. Korupolu ,  Dushmanta Mohapatra ,  Seshashayee Sankarshana Murthy ,  Aameek Singh

IPC分类号： G06F9/50

CPC分类号： G06F9/5088 ,  G06F9/505

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

摘要翻译： 本发明提供了一种数据中心连续优化的方法和系统。 该方法包括监视数据中心中的存储模块，服务器模块和交换机模块的负载，在负载超过负载阈值时检测过载状况，通过计划存储模块之间的分配迁移，结合服务器和存储虚拟化来解决存储过载问题， 地址服务器通过规划服务器模块之间的分配迁移来过载，通过规划服务器模块和存储模块之间的分配迁移组合来解决交换机过载，从而实现过载降级，并编排计划的分配迁移以减少数据中心的过载状况。

公开(公告)号：US20080295094A1

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

申请号：US11752292

申请日：2007-05-22

申请人： Madhukar R. Korupolu ,  Aameek Singh ,  Bhuvan Bamba

发明人： Madhukar R. Korupolu ,  Aameek Singh ,  Bhuvan Bamba

IPC分类号： G06F9/455

CPC分类号： G06F9/5066 ,  G06F9/5077 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/101 ,  H04L67/1021 ,  H04L67/1023 ,  H04L67/1097

摘要： A program, method and system are disclosed for planning the placement of a collection of applications in a heterogeneous storage area network data center. The program, method, and system disclosed deal with the coupled placement of virtual machine applications within a resource graph, with each application requiring a certain amount of CPU resources and a certain amount of storage resources from the connected resource node pairs within the resource graph. The resource nodes in the graph provide either storage resources, CPU resources, or both and can have differing degrees of affinity between different node pairs. Various placement algorithms may be used to optimize placement of the applications such as an individual-greedy, pair-greedy or stable marriage algorithm. One placement objective may be to place the programs among nodes of the resource graph without exceeding the storage and CPU capacities at nodes while keeping the total cost over all applications small.

摘要翻译： 公开了一种用于规划在异构存储区域网络数据中心中应用集合的放置的程序，方法和系统。 所公开的程序，方法和系统处理虚拟机应用在资源图中的耦合放置，每个应用需要来自资源图中连接的资源节点对的一定量的CPU资源和一定量的存储资源。 图中的资源节点提供存储资源，CPU资源或两者，并且可以在不同节点对之间具有不同程度的亲和度。 可以使用各种放置算法来优化诸如个人贪心，对贪婪或稳定的结婚算法的应用的放置。 一个放置目标可以是在节点之间放置节目，而不超过节点处的存储和CPU容量，同时保持所有应用程序的总成本较小。

公开(公告)号：US08230069B2

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

申请号：US12042233

申请日：2008-03-04

申请人： Madhukar R. Korupolu

发明人： Madhukar R. Korupolu

IPC分类号： G06F15/173 ,  G06F15/16

CPC分类号： H04L67/1008 ,  H04L67/1002 ,  H04L67/1097

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

摘要翻译： 提供了一种选择虚拟机（VM）迁移的目标物理机器的方法和系统。 选择用于VM迁移的目标物理机器涉及确定一个或多个候选物理机器的存储卷连接性和备用路径容量，并且优先在候选物理机中选择具有存储卷连接性和备用路径容量的迁移目标以满足存储卷访问 VM的要求。

公开(公告)号：US20090222560A1

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

申请号：US12039690

申请日：2008-02-28

申请人： Sandeep Gopisetty ,  Madhukar R. Korupolu

发明人： Sandeep Gopisetty ,  Madhukar R. Korupolu

IPC分类号： G06F15/173

CPC分类号： G06F9/5077 ,  G06F8/60 ,  G06F9/45558 ,  G06F2009/45579

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

摘要翻译： 提供了一种用于虚拟设备的集成服务器 - 存储部署规划的方法和系统。 一个实现涉及确定将虚拟设备部署到候选主机和存储子系统的不同配对的性能成本。 在候选对中优先选择主机和存储子系统对，主机和存储子系统的配对具有一定的性能成本，以满足虚拟设备的性能要求。 部署规划可以进一步涉及在一个或多个适当的空间上靠近的主机和存储子系统上部署虚拟设备，这些主机和存储子系统具有特定的优选连接和路径容量以满足虚拟设备的性能要求。

公开(公告)号：US07464078B2

公开(公告)日：2008-12-09

申请号：US11259608

申请日：2005-10-25

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

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

IPC分类号： G06F17/30

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

摘要： A by-line extraction method 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 method constructs the set of potential headlines based on the title meta-tag. The method selects a candidate headline by evaluating the set of potential headlines in order of the lengths of the potential headlines. The method 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.

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

公开(公告)号：US10108460B2

公开(公告)日：2018-10-23

申请号：US12039690

申请日：2008-02-28

申请人： Sandeep Gopisetty ,  Madhukar R. Korupolu

发明人： Sandeep Gopisetty ,  Madhukar R. Korupolu

IPC分类号： G06F15/173 ,  G06F9/50 ,  G06F8/60 ,  G06F9/455

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

公开(公告)号：US08909890B2

公开(公告)日：2014-12-09

申请号：US12709742

申请日：2010-02-22

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

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

IPC分类号： G06F3/00 ,  G06F3/06 ,  G06F9/50

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.

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

公开(公告)号：US08185754B2

公开(公告)日：2012-05-22

申请号：US12393002

申请日：2009-02-25

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

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

IPC分类号： G06F1/26

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.

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

公开(公告)号：US07917705B2

公开(公告)日：2011-03-29

申请号：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量的估计，而不超过该子树中任何节点的性能和空间界限。 进一步分析全局资源树的间隙值以生成存储系统的卷的有序分配列表（例如，自上而下的选择）。 卷可以按照分配列表的顺序应用于存储工作负载，并且间隙值和列表被更新。