利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

10 条记录 (耗时 0.034 秒)

    Mechanism for enabling the distribution of operating system resources in a multi-node computer system
    1.
    发明授权
    Mechanism for enabling the distribution of operating system resources in a multi-node computer system 有权
    在多节点计算机系统中启用操作系统资源分配的机制

    公开(公告)号：US07574708B2

    公开(公告)日：2009-08-11

    申请号：US10793476

    申请日：2004-03-04

    申请人： Lynn Keat Chung ,  Christopher Francois ,  Richard Karl Kirkman ,  Patrick Joseph McCarthy ,  Don Darrell Reed ,  Kenneth Charles Vossen

    发明人： Lynn Keat Chung ,  Christopher Francois ,  Richard Karl Kirkman ,  Patrick Joseph McCarthy ,  Don Darrell Reed ,  Kenneth Charles Vossen

    IPC分类号： G06F9/46

    CPC分类号： G06F9/5083 ,  G06F9/505 ,  G06F2209/5019

    摘要： Disclosed is an apparatus, method, and program product that enables distribution of operating system resources on a nodal basis in the same proportions as the expected system workload. The preferred embodiment of the present invention accomplishes this by assigning various types of weights to each node to represent their proportion of the overall balance within the system. Target Weights represent the desired distribution of the workload based on the existing proportions of processor and memory resources on each node. The actual workload balance on the system is represented by Current Weights, which the operating system strives to keep as close to the Target Weights as possible, on an ongoing basis. When the system is started, operating system services distribute their resources nodally in the same proportions as the Target Weights, and can request to be notified if the Target Weights ever change. If processors and/or memory are subsequently added or removed, new Target Weights are calculated at that time, and all services which requested notification are notified so they can redistribute their resources according to the new Target Weights or a stepwise refinement thereof.

    摘要翻译： 公开了一种装置，方法和程序产品，其能够以与预期系统工作负载相同的比例在节点基础上分发操作系统资源。 本发明的优选实施例通过为每个节点分配各种类型的权重来表示其在系统内的总体平衡的比例来实现。 目标权重表示基于每个节点上处理器和内存资源的现有比例的工作负载的所需分布。 系统上的实际工作负载余额由Current Weights表示，操作系统力求尽可能地保持尽可能接近目标权重。 当系统启动时，操作系统服务会以与“目标权重”相同的比例节点资源，并且如果“目标权重”（Target Weights）发生变化，则可以请求收到通知。 如果随后添加或删除处理器和/或内存，那么当时计算出新的目标权重，并通知所有请求通知的服务，以便他们可以根据新的“目标权重”或其逐步改进来重新分配资源。

    Mechanism for reducing remote memory accesses to shared data in a multi-nodal computer system
    7.
    发明申请
    Mechanism for reducing remote memory accesses to shared data in a multi-nodal computer system 失效
    减少在多节点计算机系统中对共享数据的远程存储器访问的机制

    公开(公告)号：US20050210468A1

    公开(公告)日：2005-09-22

    申请号：US10793346

    申请日：2004-03-04

    申请人： Lynn Keat Chung ,  Mark Robert Funk ,  Richard Karl Kirkman ,  Angela Mae Newton ,  Don Darrell Reed

    发明人： Lynn Keat Chung ,  Mark Robert Funk ,  Richard Karl Kirkman ,  Angela Mae Newton ,  Don Darrell Reed

    IPC分类号： G06F9/46 ,  G06F9/48 ,  G06F9/50 ,  G06F15/16

    CPC分类号： G06F9/5033 ,  G06F9/4843 ,  G06F9/505 ,  G06F9/5066

    摘要： Disclosed is an apparatus, method, and program product for identifying and grouping threads that have interdependent data access needs. The preferred embodiment of the present invention utilizes two different constructs to accomplish this grouping. A Memory Affinity Group (MAG) is disclosed. The MAG construct enables multiple threads to be associated with the same node without any foreknowledge of which threads will be involved in the association, and without any control over the particular node with which they are associated. A Logical Node construct is also disclosed. The Logical Node construct enables multiple threads to be associated with the same specified node without any foreknowledge of which threads will be involved in the association. While logical nodes do not explicitly identify the underlying physical nodes comprising the system, they provide a means of associating particular threads with the same node and other threads with other node(s).

    摘要翻译： 公开了一种用于识别和分组具有相互依赖的数据访问需求的线程的装置，方法和程序产品。 本发明的优选实施例利用两种不同的构造来完成该分组。 记录亲和组（MAG）被公开。 MAG构造使得多个线程能够与相同的节点相关联，而没有任何预先知道哪个线程将涉及关联，并且不对与它们相关联的特定节点进行任何控制。 还公开了逻辑节点构造。 逻辑节点构造使得多个线程可以与相同的指定节点相关联，而无需预先知道关联中涉及的线程。 虽然逻辑节点没有明确地识别包括系统的底层物理节点，但它们提供了将特定线程与其他节点相同的节点和其他线程相关联的手段。

    Reducing Remote Memory Accesses to Shared Data in a Multi-Nodal Computer System
    8.
    发明申请
    Reducing Remote Memory Accesses to Shared Data in a Multi-Nodal Computer System 失效
    减少远程内存访问多节点计算机系统中的共享数据

    公开(公告)号：US20100229177A1

    公开(公告)日：2010-09-09

    申请号：US12551162

    申请日：2009-08-31

    申请人： Lynn Keat Chung ,  Mark Robert Funk ,  Richard Karl Kirkman ,  Angela Mae Newton ,  Don Darrell Reed

    发明人： Lynn Keat Chung ,  Mark Robert Funk ,  Richard Karl Kirkman ,  Angela Mae Newton ,  Don Darrell Reed

    IPC分类号： G06F9/46

    CPC分类号： G06F9/5033 ,  G06F9/4843 ,  G06F9/505 ,  G06F9/5066

    摘要： Disclosed is an apparatus, method, and program product for identifying and grouping threads that have interdependent data access needs. The preferred embodiment of the present invention utilizes two different constructs to accomplish this grouping. A Memory Affinity Group (MAG) is disclosed. The MAG construct enables multiple threads to be associated with the same node without any foreknowledge of which threads will be involved in the association, and without any control over the particular node with which they are associated. A Logical Node construct is also disclosed. The Logical Node construct enables multiple threads to be associated with the same specified node without any foreknowledge of which threads will be involved in the association. While logical nodes do not explicitly identify the underlying physical nodes comprising the system, they provide a means of associating particular threads with the same node and other threads with other node(s).

    摘要翻译： 公开了一种用于识别和分组具有相互依赖的数据访问需求的线程的装置，方法和程序产品。 本发明的优选实施例利用两种不同的构造来完成该分组。 记录亲和组（MAG）被公开。 MAG构造使得多个线程能够与相同的节点相关联，而没有任何预先知道哪个线程将涉及关联，并且不对与它们相关联的特定节点进行任何控制。 还公开了逻辑节点构造。 逻辑节点构造使得多个线程可以与相同的指定节点相关联，而无需预先知道关联中涉及的线程。 虽然逻辑节点没有明确地识别包括系统的底层物理节点，但它们提供了将特定线程与其他节点相同的节点和其他线程相关联的手段。

    Mechanism for reducing remote memory accesses to shared data in a multi-nodal computer system
    9.
    发明授权
    Mechanism for reducing remote memory accesses to shared data in a multi-nodal computer system 失效
    减少在多节点计算机系统中对共享数据的远程存储器访问的机制

    公开(公告)号：US07584476B2

    公开(公告)日：2009-09-01

    申请号：US10793346

    申请日：2004-03-04

    申请人： Lynn Keat Chung ,  Mark Robert Funk ,  Richard Karl Kirkman ,  Angela Mae Newton ,  Don Darrell Reed

    发明人： Lynn Keat Chung ,  Mark Robert Funk ,  Richard Karl Kirkman ,  Angela Mae Newton ,  Don Darrell Reed

    IPC分类号： G06F9/46

    CPC分类号： G06F9/5033 ,  G06F9/4843 ,  G06F9/505 ,  G06F9/5066

    摘要： Disclosed is an apparatus, method, and program product for identifying and grouping threads that have interdependent data access needs. The preferred embodiment of the present invention utilizes two different constructs to accomplish this grouping. A Memory Affinity Group (MAG) is disclosed. The MAG construct enables multiple threads to be associated with the same node without any foreknowledge of which threads will be involved in the association, and without any control over the particular node with which they are associated. A Logical Node construct is also disclosed. The Logical Node construct enables multiple threads to be associated with the same specified node without any foreknowledge of which threads will be involved in the association. While logical nodes do not explicitly identify the underlying physical nodes comprising the system, they provide a means of associating particular threads with the same node and other threads with other node(s).

    摘要翻译： 公开了一种用于识别和分组具有相互依赖的数据访问需求的线程的装置，方法和程序产品。 本发明的优选实施例利用两种不同的构造来完成该分组。 记录亲和组（MAG）被公开。 MAG构造使得多个线程能够与相同的节点相关联，而不需要知道哪个线程将涉及关联，并且不对与它们相关联的特定节点进行任何控制。 还公开了逻辑节点构造。 逻辑节点构造使得多个线程可以与相同的指定节点相关联，而无需预先知道关联中涉及的线程。 虽然逻辑节点没有明确地识别包括系统的底层物理节点，但它们提供了将特定线程与其他节点相同的节点和其他线程相关联的手段。

    Reducing remote memory accesses to shared data in a multi-nodal computer system
    10.
    发明授权
    Reducing remote memory accesses to shared data in a multi-nodal computer system 失效
    减少在多节点计算机系统中对共享数据的远程存储器访问

    公开(公告)号：US08312462B2

    公开(公告)日：2012-11-13

    申请号：US12551162

    申请日：2009-08-31

    申请人： Lynn Keat Chung ,  Mark Robert Funk ,  Richard Karl Kirkman ,  Angela Mae Newton ,  Don Darrell Reed

    发明人： Lynn Keat Chung ,  Mark Robert Funk ,  Richard Karl Kirkman ,  Angela Mae Newton ,  Don Darrell Reed

    IPC分类号： G06F9/46 ,  G06F9/26

    CPC分类号： G06F9/5033 ,  G06F9/4843 ,  G06F9/505 ,  G06F9/5066

    摘要： Disclosed is an apparatus, method, and program product for identifying and grouping threads that have interdependent data access needs. The preferred embodiment of the present invention utilizes two different constructs to accomplish this grouping. A Memory Affinity Group (MAG) is disclosed. The MAG construct enables multiple threads to be associated with the same node without any foreknowledge of which threads will be involved in the association, and without any control over the particular node with which they are associated. A Logical Node construct is also disclosed. The Logical Node construct enables multiple threads to be associated with the same specified node without any foreknowledge of which threads will be involved in the association. While logical nodes do not explicitly identify the underlying physical nodes comprising the system, they provide a means of associating particular threads with the same node and other threads with other node(s).

    摘要翻译： 公开了一种用于识别和分组具有相互依赖的数据访问需求的线程的装置，方法和程序产品。 本发明的优选实施例利用两种不同的构造来完成该分组。 记录亲和组（MAG）被公开。 MAG构造使得多个线程能够与相同的节点相关联，而没有任何预先知道哪个线程将涉及关联，并且不对与它们相关联的特定节点进行任何控制。 还公开了逻辑节点构造。 逻辑节点构造使得多个线程可以与相同的指定节点相关联，而无需预先知道关联中涉及的线程。 虽然逻辑节点没有明确地识别包括系统的底层物理节点，但它们提供了将特定线程与其他节点相同的节点和其他线程相关联的手段。