公开(公告)号：US07743222B2

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

申请号：US12099679

申请日：2008-04-08

Applicant: Kenneth Roger Allen ,  Richard Karl Kirkman ,  Patrick Joseph McCarthy ,  Wade Byron Ouren

Inventor： Kenneth Roger Allen ,  Richard Karl Kirkman ,  Patrick Joseph McCarthy ,  Wade Byron Ouren

IPC: G06F12/00

CPC classification number: G06F9/5016 ,  G06F12/0284 ,  Y10S707/99953 ,  Y10S707/99956

Abstract: 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.

Abstract translation: 公开了用于管理动态存储器的方法，系统和媒体。 实施例可以公开识别具有用于动态存储的存储器的节点，以及从所识别的节点为堆池预留一部分存储器。 在生成堆池之后，实施例可以将动态存储从堆池分配给所接收的与所识别的节点之一相关联的任务。 更具体地，实施例标识与任务相关联的节点或家庭节点，由任务请求的动态存储器的量，以及在与任务相关联的节点中创建堆对象以提供所请求的动态存储。 一些实施例涉及在接收到任务完成并且动态存储不再需要该任务的指示时，去分配分配给该任务的动态存储器。 若干这样的实施例将去分配的动态存储返回给堆池以供重用。

公开(公告)号：US07673182B2

公开(公告)日：2010-03-02

申请号：US11425778

申请日：2006-06-22

Applicant: Thomas Michael Gooding ,  Patrick Joseph McCarthy

Inventor： Thomas Michael Gooding ,  Patrick Joseph McCarthy

IPC: G06F11/00

CPC classification number: G06F15/16 ,  G06F11/3404

Abstract: A data collector for a massively parallel computer system obtains call-return stack traceback data for multiple nodes by retrieving partial call-return stack traceback data from each node, grouping the nodes in subsets according to the partial traceback data, and obtaining further call-return stack traceback data from a representative node or nodes of each subset. Preferably, the partial data is a respective instruction address from each node, nodes having identical instruction address being grouped together in the same subset. Preferably, a single node of each subset is chosen and full stack traceback data is retrieved from the call-return stack within the chosen node.

Abstract translation: 用于大规模并行计算机系统的数据收集器通过从每个节点检索部分回调堆栈追溯数据来获得多个节点的呼叫返回堆栈追溯数据，根据部分跟踪数据对子集中的节点进行分组，并获得进一步的呼叫返回 从代表性节点或每个子集的节点堆栈回溯数据。 优选地，部分数据是来自每个节点的相应指令地址，具有相同指令地址的节点被组合在同一子集中。 优选地，选择每个子集的单个节点，并且从所选择的节点内的呼叫 - 返回堆栈检索全堆栈回溯数据。

公开(公告)号：US20090313452A1

公开(公告)日：2009-12-17

申请号：US11926799

申请日：2007-10-29

Applicant: Eric Lawrence Barsness ,  David L. Darrington ,  Patrick Joseph McCarthy ,  Amanda Peters ,  John Matthew Santosuosso

Inventor： Eric Lawrence Barsness ,  David L. Darrington ,  Patrick Joseph McCarthy ,  Amanda Peters ,  John Matthew Santosuosso

IPC: G06F12/10

CPC classification number: G06F12/1027 ,  G06F12/1072

Abstract: A method and apparatus creates and manages persistent memory (PM) in a multi-node computing system. A PM Manager in the service node creates and manages pools of nodes with various sizes of PM. A node manager uses the pools of nodes to load applications to the nodes according to the size of the available PM. The PM Manager can dynamically adjust the size of the PM according to the needs of the applications based on historical use or as determined by a system administrator. The PM Manager works with an operating system kernel on the nodes to provide persistent memory for application data and system metadata. The PM Manager uses the persistent memory to load applications to preserve data from one application to the next. Also, the data preserved in persistent memory may be system metadata such as file system data that will be available to subsequent applications.

Abstract translation: 方法和装置在多节点计算系统中创建和管理持久存储器（PM）。 服务节点中的PM管理器创建和管理具有各种大小的PM的节点池。 节点管理器使用节点池根据可用PM的大小将应用程序加载到节点。 PM管理员可以根据历史使用或系统管理员确定的应用程序的需要动态调整PM的大小。 PM管理器与节点上的操作系统内核一起工作，为应用程序数据和系统元数据提供持久性内存。 PM管理器使用持久性内存来加载应用程序以将数据从一个应用程序保留到下一个应用程序。 此外，保留在持久存储器中的数据可以是诸如文件系统数据的系统元数据，这些数据将可用于后续应用。

公开(公告)号：US07574708B2

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

申请号：US10793476

申请日：2004-03-04

Applicant: Lynn Keat Chung ,  Christopher Francois ,  Richard Karl Kirkman ,  Patrick Joseph McCarthy ,  Don Darrell Reed ,  Kenneth Charles Vossen

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

IPC: G06F9/46

CPC classification number: G06F9/5083 ,  G06F9/505 ,  G06F2209/5019

Abstract: 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.

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

公开(公告)号：US20090067334A1

公开(公告)日：2009-03-12

申请号：US11853927

申请日：2007-09-12

Applicant: Charles Jens Archer ,  David L. Darrington ,  Patrick Joseph McCarthy ,  Amanda Peters ,  Albert Sidelnik

Inventor： Charles Jens Archer ,  David L. Darrington ,  Patrick Joseph McCarthy ,  Amanda Peters ,  Albert Sidelnik

IPC: G08C15/00

CPC classification number: G06F9/4856 ,  G06F9/461 ,  G06F9/546

Abstract: Embodiments off the invention provide a mechanism for process migration on a massively parallel computer system. In particular, embodiments of the invention may be used to update process state data for a migrated compute node, such as MPI (or other communication library) state data, across a full collection of compute nodes present in a given parallel system executing a parallel task. Migrating a process form one compute node to another may be useful to address a variety of sub-optimal operating conditions. For example, one or more processes may be migrated to cure network congestion resulting from a poorly mapped task or when a compute node is predicted to experience a hardware failure.

Abstract translation: 本发明的实施例提供了一种用于大规模并行计算机系统上的过程迁移的机制。 特别地，可以使用本发明的实施例来跨越在执行并行任务的给定并行系统中存在的计算节点的整个集合来更新用于迁移的计算节点（例如MPI（或其他通信库））状态数据的进程状态数据 。 将一个计算节点迁移到另一个计算节点可能有助于解决各种次优的运行条件。 例如，可以迁移一个或多个进程以修复由映射不良的任务引起的网络拥塞，或者当预测计算节点经历硬件故障时。

公开(公告)号：US20080215845A1

公开(公告)日：2008-09-04

申请号：US12099679

申请日：2008-04-08

Applicant: Kenneth Roger Allen ,  Richard Karl Kirkman ,  Patrick Joseph McCarthy ,  Wade Byron Ouren

Inventor： Kenneth Roger Allen ,  Richard Karl Kirkman ,  Patrick Joseph McCarthy ,  Wade Byron Ouren

IPC: G06F12/00

CPC classification number: G06F9/5016 ,  G06F12/0284 ,  Y10S707/99953 ,  Y10S707/99956

Abstract: 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.

Abstract translation: 公开了用于管理动态存储器的方法，系统和媒体。 实施例可以公开识别具有用于动态存储的存储器的节点，以及从所识别的节点为堆池预留一部分存储器。 在生成堆池之后，实施例可以将动态存储从堆池分配给所接收的与所识别的节点之一相关联的任务。 更具体地，实施例标识与任务相关联的节点或家庭节点，由任务请求的动态存储器的量，以及在与任务相关联的节点中创建堆对象以提供所请求的动态存储。 一些实施例涉及在接收到任务完成并且动态存储不再需要该任务的指示时，去分配分配给该任务的动态存储器。 若干这样的实施例将去分配的动态存储返回给堆池以供重用。

公开(公告)号：US20080126767A1

公开(公告)日：2008-05-29

申请号：US11425778

申请日：2006-06-22

Applicant: Thomas Michael Gooding ,  Patrick Joseph McCarthy

Inventor： Thomas Michael Gooding ,  Patrick Joseph McCarthy

IPC: G06F9/30

CPC classification number: G06F15/16 ,  G06F11/3404

Abstract: A data collector for a massively parallel computer system obtains call-return stack traceback data for multiple nodes by retrieving partial call-return stack traceback data from each node, grouping the nodes in subsets according to the partial traceback data, and obtaining further call-return stack traceback data from a representative node or nodes of each subset. Preferably, the partial data is a respective instruction address from each node, nodes having identical instruction address being grouped together in the same subset. Preferably, a single node of each subset is chosen and full stack traceback data is retrieved from the call-return stack within the chosen node.

Abstract translation: 用于大规模并行计算机系统的数据收集器通过从每个节点检索部分回调堆栈追溯数据来获得多个节点的呼叫返回堆栈追溯数据，根据部分跟踪数据对子集中的节点进行分组，并获得进一步的呼叫返回 从代表性节点或每个子集的节点堆栈回溯数据。 优选地，部分数据是来自每个节点的相应指令地址，具有相同指令地址的节点被组合在同一子集中。 优选地，选择每个子集的单个节点，并且从所选择的节点内的呼叫 - 返回堆栈检索全堆栈回溯数据。

公开(公告)号：US07356655B2

公开(公告)日：2008-04-08

申请号：US10438393

申请日：2003-05-15

Applicant: Kenneth Roger Allen ,  Richard Karl Kirkman ,  Patrick Joseph McCarthy ,  Wade Byron Ouren

Inventor： Kenneth Roger Allen ,  Richard Karl Kirkman ,  Patrick Joseph McCarthy ,  Wade Byron Ouren

IPC: G06F12/00

CPC classification number: G06F9/5016 ,  G06F12/0284 ,  Y10S707/99953 ,  Y10S707/99956

Abstract: 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.

Abstract translation: 公开了用于管理动态存储器的方法，系统和媒体。 实施例可以公开识别具有用于动态存储的存储器的节点，以及从所识别的节点为堆池预留一部分存储器。 在生成堆池之后，实施例可以将动态存储从堆池分配给所接收的与所识别的节点之一相关联的任务。 更具体地，实施例标识与任务相关联的节点或家庭节点，由任务请求的动态存储器的量，以及在与任务相关联的节点中创建堆对象以提供所请求的动态存储。 一些实施例涉及在接收到任务完成并且动态存储不再需要该任务的指示时，去分配分配给该任务的动态存储器。 若干这样的实施例将去分配的动态存储返回给堆池以供重用。

公开(公告)号：US20080059677A1

公开(公告)日：2008-03-06

申请号：US11469034

申请日：2006-08-31

Applicant: Charles Jens Archer ,  Michael Alan Blocksome ,  Todd Alan Inglett ,  Derek Lieber ,  Patrick Joseph McCarthy ,  Michael Basil Mundy ,  Jeffrey John Parker ,  Joseph D. Ratterman ,  Brian Edward Smith

Inventor： Charles Jens Archer ,  Michael Alan Blocksome ,  Todd Alan Inglett ,  Derek Lieber ,  Patrick Joseph McCarthy ,  Michael Basil Mundy ,  Jeffrey John Parker ,  Joseph D. Ratterman ,  Brian Edward Smith

IPC: G06F13/24

CPC classification number: G06F9/4812 ,  G06F9/542 ,  G06F2209/543

Abstract: Embodiments of the present invention provide techniques for protecting critical sections of code being executed in a lightweight kernel environment suited for use on a compute node of a parallel computing system. These techniques avoid the overhead associated with a full kernel mode implementation of a network layer, while also allowing network interrupts to be processed without corrupting shared memory state. In one embodiment, a system call may be used to disable interrupts upon entry to a routine configured to process an event associated with the interrupt.

Abstract translation: 本发明的实施例提供了用于保护在适于在并行计算系统的计算节点上使用的轻量级内核环境中执行的代码的关键部分的技术。 这些技术避免了与网络层的完整内核模式实现相关的开销，同时还允许处理网络中断而不破坏共享内存状态。 在一个实施例中，系统调用可以用于在进入被配置为处理与中断相关联的事件的例程时禁止中断。

公开(公告)号：US20080022732A1

公开(公告)日：2008-01-31

申请号：US11687498

申请日：2007-03-16

Applicant: Joseph McCarthy

Inventor： Joseph McCarthy

IPC: B65D55/14

CPC classification number: B60K15/0409 ,  Y10T70/558

Abstract: A filler neck closure system includes a capless fuel tank filler neck and a closure. The closure is coupled to the capless fuel tank filler neck to close an opening into the fuel tank filler neck.

Abstract translation: 填料颈部闭合系统包括无盖燃料箱加油口和封闭件。 闭合件联接到无盖燃料箱加油口颈部以封闭燃料箱加油口颈部的开口。