-
1.发明授权Integrated placement planning for heterogenous storage area network data centers 有权异构存储区域网络数据中心综合布局规划公开(公告)号：US08341623B2
公开(公告)日：2012-12-25
申请号：US11752292
申请日：2007-05-22
IPC分类号： G06F9/455
CPC分类号： G06F9/5066 , G06F9/5077 , H04L67/1002 , H04L67/1008 , H04L67/101 , H04L67/1021 , H04L67/1023 , H04L67/1097
摘要： A storage placement planning system receives a resource graph describing SAN's resources and virtual machine applications requiring a particular amount of a processing resource element and a storage resource element. The system then determines a coupled placement of the processing element and storage element for each of the applications on a coupled pair of the resource nodes based on a specified throughput and a distance factor between coupled pairs of resource nodes. The coupled placement is determined using an algorithm that implements a cost function that determines affinities between processing nodes and storage nodes for each of said applications of a particular workload. The coupled placement for each of said applications identifies the particular amount of processing resource element placed on a first node for providing a processing resource and the particular amount of storage resource element placed on a second node for providing a storage resource for that application.
摘要翻译： 存储布局规划系统接收描述SAN的资源和虚拟机应用的资源图，该应用需要特定数量的处理资源元素和存储资源元素。 然后，系统基于指定的吞吐量和耦合的资源节点对之间的距离因子，确定在耦合的资源节点对上的每个应用的处理元件和存储元件的耦合放置。 使用实现成本函数的算法确定耦合放置，所述成本函数确定特定工作负载的每个所述应用的处理节点和存储节点之间的亲和度。 用于每个所述应用的耦合放置识别放置在第一节点上的处理资源元素的特定量，用于提供处理资源以及放置在第二节点上的特定数量的存储资源元素，以为该应用提供存储资源。
-
2.发明授权公开(公告)号：US07519624B2
公开(公告)日：2009-04-14
申请号：US11281739
申请日：2005-11-16
IPC分类号： G06F12/00 , G06F17/30 , G06F15/173
CPC分类号： G06F3/0637 , G06F3/0605 , G06F3/067
摘要： 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.
摘要翻译： 系统有效地主动评估用户对网络存储系统的影响。 在执行用户操作之前，系统通常在包括由状态和策略表示的数据库的存储区域网络上操作。 该系统包括捕获数据库状态的快照的存储监视器。 然后系统的影响分析模块将用户操作应用于快照; 并进一步选择性地将快照中的至少一些策略应用于快照。 影响分析模块模拟快照上的用户操作，而不对数据库进行实际更改，并进一步分析模拟用户操作是否违反至少一个应用策略。 系统根据分析结果采取适当的措施。
-
3.发明申请HANDLING MULTI-RANK POOLS AND VARYING DEGREES OF CONTROL IN VOLUME ALLOCATION ON STORAGE CONTROLLERS 有权处理多个储存池和储存控制器的体积分配变化程度公开(公告)号：US20090006799A1
公开(公告)日：2009-01-01
申请号：US11768604
申请日：2007-06-26
IPC分类号： G06F12/02
CPC分类号： G06F3/0644 , G06F3/0608 , G06F3/0631 , G06F3/067
摘要： 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.
摘要翻译： 公开了用于优化存储控制器上的卷分配的技术，其可以对连接存储组件的池的排列指示存储具有不同程度的控制。 基于性能的卷分配算法可以以平滑，均匀的方式优化这些各种控制器的分配，从而允许从一个程度的控制到另一个控制的变化，而不会导致昂贵的代码更改和重新构建成本。 在无法获得控制权的情况下，开发并采用可替代排列的可替代排列来计算调整后的利用成本。 反过来，调整后的利用成本用于计算受目标绩效阈值限制的空间限制值。
-
公开(公告)号：US20080148270A1
公开(公告)日：2008-06-19
申请号：US11611488
申请日：2006-12-15
IPC分类号： G06F9/46
CPC分类号： G06F9/5011 , G06F3/0605 , G06F3/0631 , G06F3/0665 , G06F3/067 , G06Q10/06
摘要： A method for storage provisioning planning including integrating capacity and provisioning planning operations. Afterwards, the method proceeds by switching via policy between integrated capacity and provisioning planning operations. The method further includes constructing an end-to-end resource model and selecting a plurality of pools based on the end-to-end resource model. Subsequently, the method includes filtering via policy between a plurality of heterogeneous controllers having resource graphs. The resource graphs contain various levels of detail. The resource graphs having hosts, switches, and storage controllers are dynamically pruned, such pruning being predicated upon the monitored performance characteristics.
摘要翻译： 一种用于存储供应计划的方法，包括集成容量和供应计划操作。 之后，该方法通过集成容量和供应计划操作之间的策略进行切换。 该方法还包括基于端到端资源模型构建端到端资源模型并选择多个池。 随后，该方法包括在具有资源图的多个异构控制器之间通过策略进行过滤。 资源图包含各种细节级别。 具有主机，交换机和存储控制器的资源图形被动态地修剪，这样的修剪是基于监视的性能特征。
-
5.发明申请SYSTEM AND METHOD FOR SELECTING AND SCHEDULING CORRECTIVE ACTIONS FOR AUTOMATED STORAGE MANAGEMENT 失效用于选择和调度自动存储管理的纠正措施的系统和方法公开(公告)号：US20080262890A1
公开(公告)日：2008-10-23
申请号：US11737249
申请日：2007-04-19
IPC分类号： G06F9/44
CPC分类号： G06Q10/06312 , G06F11/0793 , G06Q10/06 , G06Q10/06316 , G06Q10/0635
摘要： Disclosed is a storage management framework that integrates corrective action plans output from multiple different types of planning tools, sorts the different corrective action plans based on utility and risk values and outputs a time-based schedule for implementing one or more of the corrective action plans to resolve identified current and anticipated workload service level objective (SLO) violations.
摘要翻译： 公开了一种存储管理框架，其将来自多种不同类型的规划工具的校正行动计划的输出整合在一起，根据效用和风险值对不同的纠正行动计划进行排序，并输出基于时间的时间表，以执行一个或多个纠正措施计划 解决当前和预期的工作负载服务级别目标（SLO）违规。
-
6.发明授权System and method for selecting and scheduling corrective actions for automated storage management 失效用于选择和调度自动化存储管理的纠正措施的系统和方法公开(公告)号：US08326669B2
公开(公告)日：2012-12-04
申请号：US11737249
申请日：2007-04-19
IPC分类号： G06F9/44
CPC分类号： G06Q10/06312 , G06F11/0793 , G06Q10/06 , G06Q10/06316 , G06Q10/0635
摘要： Disclosed is a storage management framework that integrates corrective action plans output from multiple different types of planning tools, sorts the different corrective action plans based on utility and risk values and outputs a time-based schedule for implementing one or more of the corrective action plans to resolve identified current and anticipated workload service level objective (SLO) violations.
摘要翻译： 公开了一种存储管理框架，其将来自多种不同类型的规划工具的校正行动计划的输出整合在一起，根据效用和风险值对不同的纠正行动计划进行排序，并输出基于时间的时间表，以执行一个或多个纠正措施计划 解决当前和预期的工作负载服务级别目标（SLO）违规。
-
7.发明授权Handling multi-rank pools and varying degrees of control in volume allocation on storage controllers 有权处理多级池和存储控制器上卷分配的不同程度的控制公开(公告)号：US07809915B2
公开(公告)日：2010-10-05
申请号：US11768604
申请日：2007-06-26
CPC分类号： G06F3/0644 , G06F3/0608 , G06F3/0631 , G06F3/067
摘要： 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.
摘要翻译： 公开了用于优化存储控制器上的卷分配的技术，其可以对连接存储组件的池的排列指示存储具有不同程度的控制。 基于性能的卷分配算法可以以平滑，均匀的方式优化这些各种控制器的分配，从而允许从一个程度的控制到另一个控制的变化，而不会导致昂贵的代码更改和重新构建成本。 在无法获得控制权的情况下，开发并采用可替代排列的可替代排列来计算调整后的利用成本。 反过来，调整后的利用成本用于计算受目标绩效阈值限制的空间限制值。
-
公开(公告)号：US09424094B2
公开(公告)日：2016-08-23
申请号：US12476061
申请日：2009-06-01
IPC分类号： G06F15/173 , G06F9/50 , 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的备用资源份额的权重参数（共享）。
-
公开(公告)号：US20080291204A1
公开(公告)日：2008-11-27
申请号：US11752288
申请日：2007-05-22
申请人： Madhukar R. Korupolu , Aameek Singh
发明人： Madhukar R. Korupolu , Aameek Singh
IPC分类号： G06T11/20
CPC分类号： G06T11/206
摘要： A program and method are disclosed for placing coupled items in a resource graph using stable marriage techniques. Each coupled item requires resources of a first resource and a second resource in a resource graph. The resource nodes in the graph provide either the first resource or the second resource or both. Coupled placement defines each item as having two elements, one representing the first resource requirement and the other representing the second resource requirement, which must be placed on a pair of connected resource nodes. The objective is to place the coupled item elements among nodes of the resource graph without exceeding the first resource capacities and second resource capacities at resource nodes while keeping the total cost over all items small. A stable marriage process guides the placement that may also employ knapsacking of multiple elements on resource nodes and a swapping analysis to further optimize placement.
摘要翻译： 公开了一种使用稳定的结婚技术将耦合的物品放置在资源图中的程序和方法。 每个耦合的项目需要资源图中的第一资源和第二资源的资源。 图中的资源节点提供第一资源或第二资源或两者。 耦合放置将每个项目定义为具有两个元素，一个表示第一个资源需求，另一个表示第二个资源需求，另一个元素必须放在一对连接的资源节点上。 目的是将资源图形的节点之间的耦合项目元素放置在资源节点的第一资源容量和资源节点的第二资源容量上，同时保持所有项目的总成本较小。 一个稳定的结婚过程指导了可能在资源节点上搭载多个元素并进行交换分析来进一步优化展示位置。
-
10.发明授权公开(公告)号：US10203993B2
公开(公告)日：2019-02-12
申请号：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
摘要： 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.
-
-
-
-
-
-
-
-
-
搜索结果
38 条记录 (耗时 0.02 秒)
