利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

32 条记录 (耗时 0.029 秒)

    Partial key indexes
    1.
    发明授权
    Partial key indexes 有权
    部分关键指标

    公开(公告)号：US08429133B2

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

    申请号：US11956287

    申请日：2007-12-13

    申请人： Tirthankar Lahiri ,  Dheeraj Pandey ,  Juan R. Loaiza ,  Michael Zoll ,  Kiran B. Goyal ,  Neil J. S. Macnaughton

    发明人： Tirthankar Lahiri ,  Dheeraj Pandey ,  Juan R. Loaiza ,  Michael Zoll ,  Kiran B. Goyal ,  Neil J. S. Macnaughton

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

    CPC分类号： G06F17/30327

    摘要： A partial reverse key index is described, which allows distributed contention as resources vie to insert data into an index as well as allows range scans to be performed on the index. To do so, before an index entry for a key value is inserted into an index, the key value is transformed using a transformation operation that affects a subset of the order of the key value. The index entry is then inserted based on the transformed key value. Because the transformation operation affects the order of the key value, the transformed values associated with two consecutive key values will not necessarily be consecutive. Therefore, the index entries associated with the consecutive key values may be inserted into unrelated portions of the index.

    摘要翻译： 描述了部分反向密钥索引，其允许分布式争用作为将数据插入到索引中的资源，并且允许在索引上执行范围扫描。 为此，在将键值的索引条目插入索引之前，将使用影响键值顺序子集的转换操作来转换键值。 然后基于转换的键值插入索引条目。 由于转换操作影响键值的顺序，与两个连续的键值相关联的变换值不一定是连续的。 因此，可以将与连续键值相关联的索引条目插入索引的无关部分。

    PARTIAL KEY INDEXES
    2.
    发明申请
    PARTIAL KEY INDEXES 有权
    部分主要指标

    公开(公告)号：US20090157701A1

    公开(公告)日：2009-06-18

    申请号：US11956287

    申请日：2007-12-13

    申请人： Tirthankar Lahiri ,  Dheeraj Pandey ,  Juan R. Loaiza ,  Michael Zoll ,  Kiran B. Goyal ,  Neil J.S. Macnaughton

    发明人： Tirthankar Lahiri ,  Dheeraj Pandey ,  Juan R. Loaiza ,  Michael Zoll ,  Kiran B. Goyal ,  Neil J.S. Macnaughton

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30327

    摘要： A partial reverse key index is described, which allows distributed contention as resources vie to insert data into an index as well as allows range scans to be performed on the index. To do so, before an index entry for a key value is inserted into an index, the key value is transformed using a transformation operation that affects a subset of the order of the key value. The index entry is then inserted based on the transformed key value. Because the transformation operation affects the order of the key value, the transformed values associated with two consecutive key values will not necessarily be consecutive. Therefore, the index entries associated with the consecutive key values may be inserted into unrelated portions of the index.

    摘要翻译： 描述了部分反向密钥索引，其允许分布式争用作为将数据插入到索引中的资源，并且允许在索引上执行范围扫描。 为此，在将键值的索引条目插入索引之前，将使用影响键值顺序子集的转换操作来转换键值。 然后基于转换的键值插入索引条目。 由于转换操作影响键值的顺序，与两个连续的键值相关联的变换值不一定是连续的。 因此，可以将与连续键值相关联的索引条目插入索引的无关部分。

    Temporal affinity-based routing of workloads
    3.
    发明授权
    Temporal affinity-based routing of workloads 有权
    基于时间亲和力的工作负载路由

    公开(公告)号：US08391295B2

    公开(公告)日：2013-03-05

    申请号：US11868317

    申请日：2007-10-05

    申请人： Carol Colrain ,  Michael Zoll ,  Rajkumar Irudayaraj

    发明人： Carol Colrain ,  Michael Zoll ,  Rajkumar Irudayaraj

    IPC分类号： H04L12/56

    CPC分类号： H04L67/322 ,  H04L45/121 ,  H04L45/306 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/327

    摘要： Techniques for routing client requests among a group of nodes offering a service are described. A coordinator determines that performance could be improved by using affinity-based routing. In one embodiment, the coordinator calculates a Time-to-Live (TTL) metric whereby clients benefit by returning to the same cache and posts this hint to subscribers. Client's start preserving locality data in an affinity context, such that later requests for a connection can be routed to the location last visited. The coordinator measures the system over subsequent intervals. If the gradient of the goodness (viz service quality and capacity) is stable or improving, then the coordinator continues to advise subscribers to use the affinity-based technique. Alternatively, if the gradient of the goodness is deteriorating, then the coordinator posts advice to the subscribers to stop using the affinity-based technique for any instance during the next intervals.

    摘要翻译： 描述了在提供服务的一组节点之间路由客户端请求的技术。 协调者决定通过使用基于亲和性的路由可以提高性能。 在一个实施例中，协调器计算生存时间（TTL）度量，由此客户端通过返回到相同的高速缓存并且向用户发布该提示而受益。 客户端启动在亲和性上下文中保留位置数据，以便稍后的连接请求可以路由到上次访问的位置。 协调员在随后的时间间隔内测量系统。 如果善意的梯度（服务质量和容量）稳定或改善，协调员将继续建议用户使用基于亲和力的技术。 或者，如果善意的渐变正在恶化，则协调器向订阅者发布建议以在下一间隔期间停止对任何实例使用基于亲和力的技术。

    Time limited lock ownership
    4.
    发明授权
    Time limited lock ownership 有权

    公开(公告)号：US08370318B2

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

    申请号：US12340569

    申请日：2008-12-19

    申请人： Wilson Chan ,  Angelo Pruscino ,  Michael Zoll

    发明人： Wilson Chan ,  Angelo Pruscino ,  Michael Zoll

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

    公开(公告)号：US08429657B2

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

    申请号：US12150393

    申请日：2008-04-28

    申请人： Michael Zoll ,  Angelo Pruscino ,  Wilson Chan

    发明人： Michael Zoll ,  Angelo Pruscino ,  Wilson Chan

    IPC分类号： G06F9/46

    CPC分类号： G06F9/46 ,  G06F9/4818 ,  G06F9/5038 ,  G06F9/524

    摘要： 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
    7.
    发明申请
    Global avoidance of hang states in multi-node computing system 有权
    全局避免多节点计算系统中的挂起状态

    公开(公告)号：US20090271794A1

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

    申请号：US12150393

    申请日：2008-04-28

    申请人： Michael Zoll ,  Angelo Pruscino ,  Wilson Chan

    发明人： Michael Zoll ,  Angelo Pruscino ,  Wilson Chan

    IPC分类号： G06F9/46

    CPC分类号： G06F9/46 ,  G06F9/4818 ,  G06F9/5038 ,  G06F9/524

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

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

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

    公开(公告)号：US08069370B1

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

    申请号：US12830069

    申请日：2010-07-02

    申请人： Fulu Li ,  Mohsin Beg ,  Sameer Joshi ,  WeiHsin Gu ,  Michael Zoll ,  Angelo Pruscino

    发明人： Fulu Li ,  Mohsin Beg ,  Sameer Joshi ,  WeiHsin Gu ,  Michael Zoll ,  Angelo Pruscino

    IPC分类号： G06F11/00

    CPC分类号： G06F11/079 ,  G06F11/0709 ,  G06F11/3409 ,  H04L41/0636 ,  H04L41/064 ,  H04L41/16

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

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

    Time Limited Lock Ownership
    10.
    发明申请
    Time Limited Lock Ownership 有权
    时间有限锁所有权

    公开(公告)号：US20100161573A1

    公开(公告)日：2010-06-24

    申请号：US12340569

    申请日：2008-12-19

    申请人： Wilson Chan ,  Angelo Pruscino ,  Michael Zoll

    发明人： Wilson Chan ,  Angelo Pruscino ,  Michael Zoll

    IPC分类号： G06F17/30

    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.

    摘要翻译： 这里描述的是用于限时锁定所有权的技术。 在一个实施例中，响应于接收到对共享资源的锁定的请求，该锁被授予并且与该锁相关联的锁租约期间被建立。 然后，响应于确定锁租约期已经过期，执行一个或多个锁租约期过程。 在许多情况下，限时锁定所有权可能会阻止系统挂起，及时检测系统死锁，和/或提高数据库的整体性能。