会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Method for proactive impact analysis of policy-based storage systems
    • 基于策略的存储系统进行主动影响分析的方法
    • US07519624B2
    • 2009-04-14
    • US11281739
    • 2005-11-16
    • Madhukar R. KorupoluAameek SinghKaladhar Voruganti
    • Madhukar R. KorupoluAameek SinghKaladhar Voruganti
    • G06F12/00G06F17/30G06F15/173
    • G06F3/0637G06F3/0605G06F3/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.
    • 系统有效地主动评估用户对网络存储系统的影响。 在执行用户操作之前,系统通常在包括由状态和策略表示的数据库的存储区域网络上操作。 该系统包括捕获数据库状态的快照的存储监视器。 然后系统的影响分析模块将用户操作应用于快照; 并进一步选择性地将快照中的至少一些策略应用于快照。 影响分析模块模拟快照上的用户操作,而不对数据库进行实际更改,并进一步分析模拟用户操作是否违反至少一个应用策略。 系统根据分析结果采取适当的措施。
    • 4. 发明申请
    • COUPLED PLACEMENT OF ITEMS USING STABLE MARRIAGE TECHNIQUES
    • 使用稳定的婚姻技术联合放置物品
    • US20080291204A1
    • 2008-11-27
    • US11752288
    • 2007-05-22
    • Madhukar R. KorupoluAameek Singh
    • Madhukar R. KorupoluAameek Singh
    • G06T11/20
    • 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.
    • 公开了一种使用稳定的结婚技术将耦合的物品放置在资源图中的程序和方法。 每个耦合的项目需要资源图中的第一资源和第二资源的资源。 图中的资源节点提供第一资源或第二资源或两者。 耦合放置将每个项目定义为具有两个元素,一个表示第一个资源需求,另一个表示第二个资源需求,另一个元素必须放在一对连接的资源节点上。 目的是将资源图形的节点之间的耦合项目元素放置在资源节点的第一资源容量和资源节点的第二资源容量上,同时保持所有项目的总成本较小。 一个稳定的结婚过程指导了可能在资源节点上搭载多个元素并进行交换分析来进一步优化展示位置。
    • 8. 发明申请
    • INTEGRATED PLACEMENT PLANNING FOR HETEROGENOUS STORAGE AREA NETWORK DATA CENTERS
    • 用于异构存储区域网络数据中心的集成放置规划
    • US20080295094A1
    • 2008-11-27
    • US11752292
    • 2007-05-22
    • Madhukar R. KorupoluAameek SinghBhuvan Bamba
    • Madhukar R. KorupoluAameek SinghBhuvan Bamba
    • G06F9/455
    • G06F9/5066G06F9/5077H04L67/1002H04L67/1008H04L67/101H04L67/1021H04L67/1023H04L67/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容量,同时保持所有应用程序的总成本较小。