会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • 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 ChungChristopher FrancoisRichard Karl KirkmanPatrick Joseph McCarthyDon Darrell ReedKenneth Charles Vossen
    • Lynn Keat ChungChristopher FrancoisRichard Karl KirkmanPatrick Joseph McCarthyDon Darrell ReedKenneth Charles Vossen
    • G06F9/46
    • G06F9/5083G06F9/505G06F2209/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)发生变化,则可以请求收到通知。 如果随后添加或删除处理器和/或内存,那么当时计算出新的目标权重,并通知所有请求通知的服务,以便他们可以根据新的“目标权重”或其逐步改进来重新分配资源。
    • 5. 发明授权
    • Methods, systems, and media for managing dynamic storage
    • 用于管理动态存储的方法,系统和媒体
    • US07743222B2
    • 2010-06-22
    • US12099679
    • 2008-04-08
    • Kenneth Roger AllenRichard Karl KirkmanPatrick Joseph McCarthyWade Byron Ouren
    • Kenneth Roger AllenRichard Karl KirkmanPatrick Joseph McCarthyWade Byron Ouren
    • G06F12/00
    • G06F9/5016G06F12/0284Y10S707/99953Y10S707/99956
    • Methods, systems, and media for managing dynamic memory are disclosed. Embodiments may disclose identifying nodes with having memory for dynamic storage, and reserving a portion of the memory from the identified nodes for a heap pool. After generating a heap pool, embodiments may allocate dynamic storage from the heap pool to tasks received that are associated with one of the identified nodes. More specifically, embodiments identify the node or home node associated with the task, the amount of dynamic storage requested by the task, and create a heap object in the node associated with the task to provide the requested dynamic storage. Some embodiments involve de-allocating the dynamic storage assigned to the task upon receipt of an indication that the task is complete and the dynamic storage is no longer needed for the task. Several of such embodiments return the de-allocated dynamic storage to the heap pool for reuse.
    • 公开了用于管理动态存储器的方法,系统和媒体。 实施例可以公开识别具有用于动态存储的存储器的节点,以及从所识别的节点为堆池预留一部分存储器。 在生成堆池之后,实施例可以将动态存储从堆池分配给所接收的与所识别的节点之一相关联的任务。 更具体地,实施例标识与任务相关联的节点或家庭节点,由任务请求的动态存储器的量,以及在与任务相关联的节点中创建堆对象以提供所请求的动态存储。 一些实施例涉及在接收到任务完成并且动态存储不再需要该任务的指示时,去分配分配给该任务的动态存储器。 若干这样的实施例将去分配的动态存储返回给堆池以供重用。
    • 6. 发明申请
    • Methods, Systems, and Media for Managing Dynamic Storage
    • 用于管理动态存储的方法,系统和媒体
    • US20080215845A1
    • 2008-09-04
    • US12099679
    • 2008-04-08
    • Kenneth Roger AllenRichard Karl KirkmanPatrick Joseph McCarthyWade Byron Ouren
    • Kenneth Roger AllenRichard Karl KirkmanPatrick Joseph McCarthyWade Byron Ouren
    • G06F12/00
    • G06F9/5016G06F12/0284Y10S707/99953Y10S707/99956
    • Methods, systems, and media for managing dynamic memory are disclosed. Embodiments may disclose identifying nodes with having memory for dynamic storage, and reserving a portion of the memory from the identified nodes for a heap pool. After generating a heap pool, embodiments may allocate dynamic storage from the heap pool to tasks received that are associated with one of the identified nodes. More specifically, embodiments identify the node or home node associated with the task, the amount of dynamic storage requested by the task, and create a heap object in the node associated with the task to provide the requested dynamic storage. Some embodiments involve de-allocating the dynamic storage assigned to the task upon receipt of an indication that the task is complete and the dynamic storage is no longer needed for the task. Several of such embodiments return the de-allocated dynamic storage to the heap pool for reuse.
    • 公开了用于管理动态存储器的方法,系统和媒体。 实施例可以公开识别具有用于动态存储的存储器的节点,以及从所识别的节点为堆池预留一部分存储器。 在生成堆池之后,实施例可以将动态存储从堆池分配给所接收的与所识别的节点之一相关联的任务。 更具体地,实施例标识与任务相关联的节点或家庭节点,由任务请求的动态存储器的量,以及在与任务相关联的节点中创建堆对象以提供所请求的动态存储。 一些实施例涉及在接收到任务完成并且动态存储不再需要该任务的指示时,去分配分配给该任务的动态存储器。 若干这样的实施例将去分配的动态存储返回给堆池以供重用。
    • 7. 发明授权
    • Methods, systems, and media for managing dynamic storage
    • 用于管理动态存储的方法,系统和媒体
    • US07356655B2
    • 2008-04-08
    • US10438393
    • 2003-05-15
    • Kenneth Roger AllenRichard Karl KirkmanPatrick Joseph McCarthyWade Byron Ouren
    • Kenneth Roger AllenRichard Karl KirkmanPatrick Joseph McCarthyWade Byron Ouren
    • G06F12/00
    • G06F9/5016G06F12/0284Y10S707/99953Y10S707/99956
    • Methods, systems, and media for managing dynamic memory are disclosed. Embodiments may disclose identifying nodes with having memory for dynamic storage, and reserving a portion of the memory from the identified nodes for a heap pool. After generating a heap pool, embodiments may allocate dynamic storage from the heap pool to tasks received that are associated with one of the identified nodes. More specifically, embodiments identify the node or home node associated with the task, the amount of dynamic storage requested by the task, and create a heap object in the node associated with the task to provide the requested dynamic storage. Some embodiments involve de-allocating the dynamic storage assigned to the task upon receipt of an indication that the task is complete and the dynamic storage is no longer needed for the task. Several of such embodiments return the de-allocated dynamic storage to the heap pool for reuse.
    • 公开了用于管理动态存储器的方法,系统和媒体。 实施例可以公开识别具有用于动态存储的存储器的节点,以及从所识别的节点为堆池预留一部分存储器。 在生成堆池之后,实施例可以将动态存储从堆池分配给所接收的与所识别的节点之一相关联的任务。 更具体地,实施例标识与任务相关联的节点或家庭节点,由任务请求的动态存储器的量,以及在与任务相关联的节点中创建堆对象以提供所请求的动态存储。 一些实施例涉及在接收到任务完成并且动态存储不再需要该任务的指示时,去分配分配给该任务的动态存储器。 若干这样的实施例将去分配的动态存储返回给堆池以供重用。