会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Temporal affinity-based routing of workloads
    • 基于时间亲和力的工作负载路由
    • US08391295B2
    • 2013-03-05
    • US11868317
    • 2007-10-05
    • Carol ColrainMichael ZollRajkumar Irudayaraj
    • Carol ColrainMichael ZollRajkumar Irudayaraj
    • H04L12/56
    • H04L67/322H04L45/121H04L45/306H04L67/1002H04L67/1008H04L67/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)度量,由此客户端通过返回到相同的高速缓存并且向用户发布该提示而受益。 客户端启动在亲和性上下文中保留位置数据,以便稍后的连接请求可以路由到上次访问的位置。 协调员在随后的时间间隔内测量系统。 如果善意的梯度(服务质量和容量)稳定或改善,协调员将继续建议用户使用基于亲和力的技术。 或者,如果善意的渐变正在恶化,则协调器向订阅者发布建议以在下一间隔期间停止对任何实例使用基于亲和力的技术。
    • 2. 发明申请
    • TEMPORAL AFFINITY-BASED ROUTING OF WORKLOADS
    • 基于临时性的工作流程路由
    • US20090034537A1
    • 2009-02-05
    • US11868317
    • 2007-10-05
    • Carol ColrainMichael ZollRajkumar Irudayaraj
    • Carol ColrainMichael ZollRajkumar Irudayaraj
    • H04L12/56
    • H04L67/322H04L45/121H04L45/306H04L67/1002H04L67/1008H04L67/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)度量,由此客户端通过返回到相同的高速缓存并且向用户发布该提示而受益。 客户端启动在亲和性上下文中保留位置数据,以便稍后的连接请求可以路由到上次访问的位置。 协调员在随后的时间间隔内测量系统。 如果善意的梯度(服务质量和容量)稳定或改善,协调员将继续建议用户使用基于亲和力的技术。 或者,如果善意的渐变正在恶化,则协调器向订阅者发布建议以在下一间隔期间停止对任何实例使用基于亲和力的技术。
    • 6. 发明授权
    • Global avoidance of hang states via priority inheritance in multi-node computing system
    • 通过多节点计算系统中的优先级继承来全局避免挂起状态
    • US08429657B2
    • 2013-04-23
    • US12150393
    • 2008-04-28
    • Michael ZollAngelo PruscinoWilson Chan
    • Michael ZollAngelo PruscinoWilson Chan
    • G06F9/46
    • G06F9/46G06F9/4818G06F9/5038G06F9/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.
    • 描述了与避免资源阻塞和挂起状态相关联的系统,方法和其他实施例。 用于集群计算系统的一个示例性计算机实现的方法包括确定第一进程正在等待资源并且处于阻塞状态。 确定第一个进程正在等待的资源。 然后识别持有资源的阻塞进程。 将阻塞进程的优先级与第一进程的优先级进行比较。 如果阻塞进程的优先级低于第一个进程的优先级,阻塞进程的优先级就会增加。 以这种方式,可以更快地将阻塞进程安排进行执行,从而释放资源。
    • 7. 发明申请
    • Global avoidance of hang states in multi-node computing system
    • 全局避免多节点计算系统中的挂起状态
    • US20090271794A1
    • 2009-10-29
    • US12150393
    • 2008-04-28
    • Michael ZollAngelo PruscinoWilson Chan
    • Michael ZollAngelo PruscinoWilson Chan
    • G06F9/46
    • G06F9/46G06F9/4818G06F9/5038G06F9/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.
    • 描述了与避免资源阻塞和挂起状态相关联的系统,方法和其他实施例。 用于集群计算系统的一个示例性计算机实现的方法包括确定第一进程正在等待资源并且处于阻塞状态。 确定第一个进程正在等待的资源。 然后识别持有资源的阻塞进程。 将阻塞进程的优先级与第一进程的优先级进行比较。 如果阻塞进程的优先级低于第一个进程的优先级,阻塞进程的优先级就会增加。 以这种方式,可以更快地将阻塞进程安排进行执行,从而释放资源。