Anticipatory changes to resources managed by locks
    11.
    发明授权
    Anticipatory changes to resources managed by locks 有权
    锁定资源的预期变更

    公开(公告)号:US07392335B2

    公开(公告)日:2008-06-24

    申请号:US11351675

    申请日:2006-02-10

    IPC分类号: G06F12/14

    CPC分类号: G06F9/526

    摘要: A method and system are provided for performing anticipatory changes to a resource governed by a locking mechanism. Entities (such as transactions in a database system) that want to modify a resource request permission to modify the resource. However, prior to receiving permission, they make anticipatory changes to a private version of the resource. The entities are prevented from making the anticipatory changes permanent until they receive permission to make the changes. Because they can make the changes, and proceed to other operations, before receiving permission, any delay in receiving permission has less adverse effect on their performance.

    摘要翻译: 提供了一种方法和系统,用于对由锁定机构控制的资源执行预期的改变。 要修改资源请求修改资源的权限的实体(如数据库系统中的事务)。 但是,在获得许可之前,他们会对资源的私有版本做出预期的更改。 这些实体被阻止使预期变化持续,直到他们获得进行更改的许可。 由于可以进行变更,进行其他操作,在获得许可之前,任何延迟的接收许可对其性能的影响较小。

    DYNAMIC REMASTERING FOR A SUBSET OF NODES IN A CLUSTER ENVIRONMENT
    12.
    发明申请
    DYNAMIC REMASTERING FOR A SUBSET OF NODES IN A CLUSTER ENVIRONMENT 有权
    一个群集环境中的节点的动态重新动态

    公开(公告)号:US20060143178A1

    公开(公告)日:2006-06-29

    申请号:US11024347

    申请日:2004-12-27

    IPC分类号: G06F17/30 G06F7/00

    摘要: Techniques are provided for mastering resources by assigning resources to mastery-eligible-sets. The resources that are assigned to a mastery-eligible-set may be mastered only at nodes that belong to the mastery-eligible-set. The membership of a mastery-eligible-set for a given set of related resources may be established based on which nodes have the highest affinity for the given set of related resources. Resource usage may be monitored, and the system may be periodically reconfigured, by changing membership of the mastery-eligible-sets, based on the usage information.

    摘要翻译: 提供了通过将资源分配给符合资格的资源来掌握资源的技术。 分配给精通符合资格的资源的资源只能在属于掌握资格的资源集合的节点上掌握。 可以基于哪些节点对给定的一组相关资源具有最高的亲和力来建立针对给定的一组相关资源的精通符合资格的成员资格。 可以监视资源使用情况,并且可以通过基于使用信息来改变掌握资格的集合的成员资格来周期性地重新配置系统。

    Remastering for asymmetric clusters in high-load scenarios
    13.
    发明申请
    Remastering for asymmetric clusters in high-load scenarios 有权
    在高负载情况下修复非对称集群

    公开(公告)号:US20050149540A1

    公开(公告)日:2005-07-07

    申请号:US11061796

    申请日:2005-02-17

    IPC分类号: G06F7/00 G06F17/30

    摘要: Techniques are provided for remastering resources based on node utilization. According to one such technique, resources are remastered in response to the over-utilization of the node that currently masters those resources. The utilization of each node is tracked, and when a particular node's utilization exceeds a specified threshold, selected resources that are currently mastered by that node are remastered so that nodes other than the particular node become the new masters for the selected resources. Each node's utilization is based on that node's capacity, and each node's capacity may differ. According to an aspect of one technique, each node's capacity is based on that node's processing resources and memory resources. Remastering resources in this manner tends to reduce the average amount of time taken for nodes to handle requests for the resources that they master.

    摘要翻译: 提供了基于节点利用重新编制资源的技术。 根据一种这样的技术,响应于当前主控这些资源的节点的过度利用而重新资源化资源。 跟踪每个节点的利用率,并且当特定节点的利用率超过指定的阈值时,重新分配由该节点当前掌握的所选择的资源,使得除特定节点之外的节点成为所选资源的新的主节点。 每个节点的利用率都是基于该节点的容量,并且每个节点的容量可能不同。 根据一种技术的一个方面,每个节点的容量基于该节点的处理资源和存储器资源。 以这种方式修复资源往往会减少节​​点处理其掌握的资源请求所需的平均时间。

    Techniques for granting shared locks more efficiently
    14.
    发明授权
    Techniques for granting shared locks more efficiently 有权
    更有效地授予共享锁的技术

    公开(公告)号:US06965893B1

    公开(公告)日:2005-11-15

    申请号:US09746580

    申请日:2000-12-20

    IPC分类号: G06F17/30

    摘要: Techniques are disclosed for managing resources that are accessible to a plurality of entities. In one embodiment, shared locks on a resource are granted more efficiently by maintaining data that is local to (e.g. on the same node as) each entity to indicate whether an exclusive lock has been granted on the resource to any entity of the plurality of entities. Data that (15) is maintained local to an entity, and that (16) indicates whether any entity has an exclusive lock on a particular resource is referred to herein as a “local exclusive lock flag” for that particular resource. When an entity of the plurality of entities seeks to acquire a shared lock for a particular resource, that entity checks the local exclusive lock flag for that particular resource. If the local exclusive lock flag indicates that no entity holds an exclusive lock on the resource, then the entity seeking the shared lock acquires the shared lock without first receiving a lock grant from the resource manager that manages the resource. In many cases, the resource manager that manages the resource is remotely located relative to the entity that desires the shared lock. Because the local exclusive lock flag is local, the act of checking it does not incur the overhead associated with communicating with a remotely located resource manager. Thus, obtaining a shared lock based on the state of a local exclusive lock flag significantly increases the efficiency of managing access to the resource, particularly for resources for which entities do not frequently require exclusive access.

    摘要翻译: 公开了用于管理可由多个实体访问的资源的技术。 在一个实施例中,通过维护对每个实体进行本地(例如与同一个节点)的数据来指示资源是否已被授予该多个实体中的任何实体的排他锁,来更有效地授予资源上的共享锁 。 数据(15)被维持在一个实体本地,并且(16)指示任何实体是否具有对特定资源的排他锁在这里被称为该特定资源的“本地排除锁定标志”。 当多个实体的实体寻求获取特定资源的共享锁时,该实体检查该特定资源的本地排他锁定标志。 如果本地排他锁标志指示没有实体对该资源持有排他锁,则寻求共享锁的实体获取共享锁,而不首先从管理资源的资源管理器接收到锁授权。 在许多情况下,管理资源的资源管理器相对于希望共享锁定的实体位于远处。 因为本地排他锁标志是本地的,因此检查它的行为不会产生与与远程位置的资源管理器通信相关的开销。 因此,基于本地排除锁定标志的状态获得共享锁显着地提高了对资源的访问的效率,特别是对于实体不频繁地要求独占访问的资源。

    Time limited lock ownership
    15.
    发明授权

    公开(公告)号:US08370318B2

    公开(公告)日:2013-02-05

    申请号:US12340569

    申请日:2008-12-19

    IPC分类号: G06F17/00

    CPC分类号: G06F9/52 G06F17/30362

    摘要: Described herein are techniques for time limited lock ownership. In one embodiment, in response to receiving a request for a lock on a shared resource, the lock is granted and a lock lease period associated with the lock is established. Then, in response to determining that the lock lease period has expired, one or more lock lease expiration procedures are performed. In many cases, the time limited lock ownership may prevent system hanging, timely detect system deadlocks, and/or improve overall performance of the database.

    Global avoidance of hang states via priority inheritance in multi-node computing system
    16.
    发明授权
    Global avoidance of hang states via priority inheritance in multi-node computing system 有权
    通过多节点计算系统中的优先级继承来全局避免挂起状态

    公开(公告)号:US08429657B2

    公开(公告)日:2013-04-23

    申请号:US12150393

    申请日:2008-04-28

    IPC分类号: G06F9/46

    摘要: Systems, methods, and other embodiments associated with avoiding resource blockages and hang states are described. One example computer-implemented method for a clustered computing system includes determining that a first process is waiting for a resource and is in a blocked state. The resource that the first process is waiting for is identified. A blocking process that is holding the resource is then identified. A priority of the blocking process is compared with a priority the first process. If the priority of the blocking process is lower than the priority of the first process, the priority of the blocking process is increase. In this manner the blocking process can be scheduled for execution sooner and thus release the resource.

    摘要翻译: 描述了与避免资源阻塞和挂起状态相关联的系统,方法和其他实施例。 用于集群计算系统的一个示例性计算机实现的方法包括确定第一进程正在等待资源并且处于阻塞状态。 确定第一个进程正在等待的资源。 然后识别持有资源的阻塞进程。 将阻塞进程的优先级与第一进程的优先级进行比较。 如果阻塞进程的优先级低于第一个进程的优先级,阻塞进程的优先级就会增加。 以这种方式,可以更快地将阻塞进程安排进行执行,从而释放资源。

    Global avoidance of hang states in multi-node computing system
    17.
    发明申请
    Global avoidance of hang states in multi-node computing system 有权
    全局避免多节点计算系统中的挂起状态

    公开(公告)号:US20090271794A1

    公开(公告)日:2009-10-29

    申请号:US12150393

    申请日:2008-04-28

    IPC分类号: G06F9/46

    摘要: Systems, methods, and other embodiments associated with avoiding resource blockages and hang states are described. One example computer-implemented method for a clustered computing system includes determining that a first process is waiting for a resource and is in a blocked state. The resource that the first process is waiting for is identified. A blocking process that is holding the resource is then identified. A priority of the blocking process is compared with a priority the first process. If the priority of the blocking process is lower than the priority of the first process, the priority of the blocking process is increase. In this manner the blocking process can be scheduled for execution sooner and thus release the resource.

    摘要翻译: 描述了与避免资源阻塞和挂起状态相关联的系统,方法和其他实施例。 用于集群计算系统的一个示例性计算机实现的方法包括确定第一进程正在等待资源并且处于阻塞状态。 确定第一个进程正在等待的资源。 然后识别持有资源的阻塞进程。 将阻塞进程的优先级与第一进程的优先级进行比较。 如果阻塞进程的优先级低于第一个进程的优先级,阻塞进程的优先级就会增加。 以这种方式,可以更快地将阻塞进程安排进行执行,从而释放资源。

    SUPER MASTER
    18.
    发明申请
    SUPER MASTER 有权
    超级大师

    公开(公告)号:US20100174802A1

    公开(公告)日:2010-07-08

    申请号:US12350182

    申请日:2009-01-07

    IPC分类号: G06F15/16

    CPC分类号: G06F17/30362

    摘要: Described herein are techniques for using super masters to coordinate accesses by nodes in a database server cluster to data stored in a database. In many cases, the number of inter-nodal messages is reduced, thereby saving the overheads attendant to coordinating accesses in such a system.

    摘要翻译: 这里描述的是使用超级主人来协调数据库服务器集群中的节点到存储在数据库中的数据的访问的技术。 在许多情况下,减少节点间消息的数量,从而节省了在这种系统中协调访问的开销。

    Anticipatory changes to resources managed by locks
    19.
    发明申请
    Anticipatory changes to resources managed by locks 有权
    锁定资源的预期变更

    公开(公告)号:US20070192524A1

    公开(公告)日:2007-08-16

    申请号:US11351675

    申请日:2006-02-10

    IPC分类号: G06F12/14

    CPC分类号: G06F9/526

    摘要: A method and system are provided for performing anticipatory changes to a resource governed by a locking mechanism. Entities (such as transactions in a database system) that want to modify a resource request permission to modify the resource. However, prior to receiving permission, they make anticipatory changes to a private version of the resource. The entities are prevented from making the anticipatory changes permanent until they receive permission to make the changes. Because they can make the changes, and proceed to other operations, before receiving permission, any delay in receiving permission has less adverse effect on their performance.

    摘要翻译: 提供了一种方法和系统,用于对由锁定机构控制的资源执行预期的改变。 要修改资源请求修改资源的权限的实体(如数据库系统中的事务)。 但是,在获得许可之前,他们会对资源的私有版本做出预期的更改。 这些实体被阻止使预期变化持续,直到他们获得进行更改的许可。 由于可以进行变更,进行其他操作,在获得许可之前,任何延迟的接收许可对其性能的影响较小。

    Fault identification of multi-host complex systems with timesliding window analysis in a time series
    20.
    发明授权
    Fault identification of multi-host complex systems with timesliding window analysis in a time series 有权
    多时间复杂系统的故障识别与时间序列窗口分析

    公开(公告)号:US08069370B1

    公开(公告)日:2011-11-29

    申请号:US12830069

    申请日:2010-07-02

    IPC分类号: G06F11/00

    摘要: A method and apparatus is provided for determining the most probable cause of a problem observed in a complex multi-host system. The approach relies on a probabilistic model to represent causes and effects in a complex computing system. However, complex systems include a multitude of independently operating components that can cause temporary anomalous states. To reduce the resources required to perform root cause analysis on each transient failure, as well as to raise the confidence in the most probable cause of a failure that is identified by the model, inputs to the probabilistic model are aggregated over a sliding window of values from the recent past.

    摘要翻译: 提供了一种用于确定在复杂的多主机系统中观察到的问题的最可能原因的方法和装置。 该方法依赖于概率模型来表示复杂计算系统中的原因和影响。 然而,复杂的系统包括许多可以引起临时异常状态的独立运行的组件。 为了减少对每个瞬态故障执行根本原因分析所需的资源,以及提高对由模型识别的故障的最可能原因的置信度,对概率模型的输入在值的滑动窗口上聚合 从最近过去。