公开(公告)号：US09081501B2

公开(公告)日：2015-07-14

申请号：US13004007

申请日：2011-01-10

Applicant: Sameh Asaad ,  Ralph E. Bellofatto ,  Michael A. Blocksome ,  Matthias A. Blumrich ,  Peter Boyle ,  Jose R. Brunheroto ,  Dong Chen ,  Chen-Yong Cher ,  George L. Chiu ,  Norman Christ ,  Paul W. Coteus ,  Kristan D. Davis ,  Gabor J. Dozsa ,  Alexandre E. Eichenberger ,  Noel A. Eisley ,  Matthew R. Ellavsky ,  Kahn C. Evans ,  Bruce M. Fleischer ,  Thomas W. Fox ,  Alan Gara ,  Mark E. Giampapa ,  Thomas M. Gooding ,  Michael K. Gschwind ,  John A. Gunnels ,  Shawn A. Hall ,  Rudolf A. Haring ,  Philip Heidelberger ,  Todd A. Inglett ,  Brant L. Knudson ,  Gerard V. Kopcsay ,  Sameer Kumar ,  Amith R. Mamidala ,  James A. Marcella ,  Mark G. Megerian ,  Douglas R. Miller ,  Samuel J. Miller ,  Adam J. Muff ,  Michael B. Mundy ,  John K. O'Brien ,  Kathryn M. O'Brien ,  Martin Ohmacht ,  Jeffrey J. Parker ,  Ruth J. Poole ,  Joseph D. Ratterman ,  Valentina Salapura ,  David L. Satterfield ,  Robert M. Senger ,  Brian Smith ,  Burkhard Steinmacher-Burow ,  William M. Stockdell ,  Craig B. Stunkel ,  Krishnan Sugavanam ,  Yutaka Sugawara ,  Todd E. Takken ,  Barry M. Trager ,  James L. Van Oosten ,  Charles D. Wait ,  Robert E. Walkup ,  Alfred T. Watson ,  Robert W. Wisniewski ,  Peng Wu

Inventor： Sameh Asaad ,  Ralph E. Bellofatto ,  Michael A. Blocksome ,  Matthias A. Blumrich ,  Peter Boyle ,  Jose R. Brunheroto ,  Dong Chen ,  Chen-Yong Cher ,  George L. Chiu ,  Norman Christ ,  Paul W. Coteus ,  Kristan D. Davis ,  Gabor J. Dozsa ,  Alexandre E. Eichenberger ,  Noel A. Eisley ,  Matthew R. Ellavsky ,  Kahn C. Evans ,  Bruce M. Fleischer ,  Thomas W. Fox ,  Alan Gara ,  Mark E. Giampapa ,  Thomas M. Gooding ,  Michael K. Gschwind ,  John A. Gunnels ,  Shawn A. Hall ,  Rudolf A. Haring ,  Philip Heidelberger ,  Todd A. Inglett ,  Brant L. Knudson ,  Gerard V. Kopcsay ,  Sameer Kumar ,  Amith R. Mamidala ,  James A. Marcella ,  Mark G. Megerian ,  Douglas R. Miller ,  Samuel J. Miller ,  Adam J. Muff ,  Michael B. Mundy ,  John K. O'Brien ,  Kathryn M. O'Brien ,  Martin Ohmacht ,  Jeffrey J. Parker ,  Ruth J. Poole ,  Joseph D. Ratterman ,  Valentina Salapura ,  David L. Satterfield ,  Robert M. Senger ,  Brian Smith ,  Burkhard Steinmacher-Burow ,  William M. Stockdell ,  Craig B. Stunkel ,  Krishnan Sugavanam ,  Yutaka Sugawara ,  Todd E. Takken ,  Barry M. Trager ,  James L. Van Oosten ,  Charles D. Wait ,  Robert E. Walkup ,  Alfred T. Watson ,  Robert W. Wisniewski ,  Peng Wu

IPC: G06F15/173 ,  G06F9/06 ,  G06F15/76

CPC classification number: G06F13/287 ,  G06F9/06 ,  G06F9/3004 ,  G06F9/30047 ,  G06F9/3885 ,  G06F12/0811 ,  G06F12/0831 ,  G06F12/0862 ,  G06F12/0864 ,  G06F12/1027 ,  G06F15/17381 ,  G06F15/17387 ,  G06F15/76 ,  G06F15/8069 ,  G06F2212/1016 ,  G06F2212/602 ,  G06F2212/6022 ,  G06F2212/6024 ,  G06F2212/6032 ,  Y02D10/13 ,  Y02D10/14

Abstract: A Multi-Petascale Highly Efficient Parallel Supercomputer of 100 petaOPS-scale computing, at decreased cost, power and footprint, and that allows for a maximum packaging density of processing nodes from an interconnect point of view. The Supercomputer exploits technological advances in VLSI that enables a computing model where many processors can be integrated into a single Application Specific Integrated Circuit (ASIC). Each ASIC computing node comprises a system-on-chip ASIC utilizing four or more processors integrated into one die, with each having full access to all system resources and enabling adaptive partitioning of the processors to functions such as compute or messaging I/O on an application by application basis, and preferably, enable adaptive partitioning of functions in accordance with various algorithmic phases within an application, or if I/O or other processors are underutilized, then can participate in computation or communication nodes are interconnected by a five dimensional torus network with DMA that optimally maximize the throughput of packet communications between nodes and minimize latency.

Abstract translation: 具有100 petaOPS规模计算的多Petascale高效并行超级计算机，其成本，功耗和占地面积都在降低，并且允许从互连角度来看处理节点的最大封装密度。 超级计算机利用了VLSI的技术进步，实现了许多处理器可以集成到单个专用集成电路（ASIC）中的计算模型。 每个ASIC计算节点包括利用集成到一个管芯中的四个或更多个处理器的片上系统ASIC，每个处理器具有对所有系统资源的完全访问，并且使得处理器能够对诸如计算或消息传递I / O 并且优选地，根据应用内的各种算法阶段实现功能的自适应分割，或者如果I / O或其他处理器未被充分利用，则可以参与计算或通信节点通过五维环面网络互连 使用DMA来最大限度地最大化节点之间的分组通信的吞吐量并最小化等待时间。

公开(公告)号：US08990450B2

公开(公告)日：2015-03-24

申请号：US13470890

申请日：2012-05-14

Applicant: Michael A. Blocksome ,  Todd A. Inglett ,  Patrick J. McCarthy ,  Joseph D. Ratterman ,  Brian E. Smith

Inventor： Michael A. Blocksome ,  Todd A. Inglett ,  Patrick J. McCarthy ,  Joseph D. Ratterman ,  Brian E. Smith

IPC: G06F13/28

CPC classification number: G06F13/28

Abstract: Managing a direct memory access (‘DMA’) injection first-in-first-out (‘FIFO’) messaging queue in a parallel computer, including: inserting, by a messaging unit management module, a DMA message descriptor into the injection FIFO messaging queue; determining, by the messaging unit management module, the number of extra slots in an immediate messaging queue required to store DMA message data associated with the DMA message descriptor; and responsive to determining that the number of extra slots in the immediate message queue required to store the DMA message data is greater than one, inserting, by the messaging unit management module, a number of DMA dummy message descriptors into the injection FIFO messaging queue, wherein the number of DMA dummy message descriptors is at least as many as the number of extra slots in the immediate messaging queue that are required to store the DMA message data.

Abstract translation: 在并行计算机中管理直接存储器访问（'DMA'）注入先进先出（'FIFO'）消息队列，包括：消息传送单元管理模块将DMA消息描述符插入注入FIFO消息 队列; 由所述消息收发单元管理模块确定存储与所述DMA消息描述符相关联的DMA消息数据所需的立即消息队列中的额外时隙的数量; 并且响应于确定存储DMA消息数据所需的即时消息队列中的额外时隙的数量大于1，由消息接发单元管理模块将多个DMA虚拟消息描述符插入到注入FIFO消息队列中， 其中DMA虚拟消息描述符的数量至少等于存储DMA消息数据所需的立即消息队列中的额外时隙的数量。

公开(公告)号：US08949453B2

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

申请号：US12956903

申请日：2010-11-30

Applicant: Charles J. Archer ,  Michael A. Blocksome ,  Joseph D. Ratterman ,  Brian E. Smith

Inventor： Charles J. Archer ,  Michael A. Blocksome ,  Joseph D. Ratterman ,  Brian E. Smith

IPC: G06F9/46 ,  G06F9/54

CPC classification number: G06F9/546

Abstract: Data communications in a parallel active messaging interface (‘PAMI’) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including a specification of data communications parameters for a thread of execution on a compute node, including specifications of a client, a context, and a task, endpoints coupled for data communications through the PAMI and through data communications resources, including receiving in an origin endpoint of the PAMI a SEND instruction, the SEND instruction specifying a transmission of transfer data from the origin endpoint to a first target endpoint; transmitting from the origin endpoint to the first target endpoint a Request-To-Send (‘RTS’) message advising the first target endpoint of the location and size of the transfer data; assigning by the first target endpoint to each of a plurality of target endpoints separate portions of the transfer data; and receiving by the plurality of target endpoints the transfer data.

Abstract translation: 并行计算机的并行活动消息接口（“PAMI”）中的数据通信，由数据通信端点组成的PAMI，每个端点包括计算节点上的执行线程的数据通信参数的规范，包括客户端的规范 ，上下文和任务，通过PAMI和通过数据通信资源耦合用于数据通信的端点，包括在PAMI的原点端点接收SEND指令，SEND指令指定传输数据从原始端点传输到 第一个目标终点; 从所述起始端点向所述第一目标端点发送向所述第一目标端点通知所述传送数据的位置和大小的请求发送（'RTS'）消息; 将第一目标端点分配给多个目标端点中的每一个分离传输数据的部分; 以及由所述多个目标端点接收所述传送数据。

公开(公告)号：US08910178B2

公开(公告)日：2014-12-09

申请号：US13206581

申请日：2011-08-10

Applicant: Charles J. Archer ,  Michael A. Blocksome ,  Joseph D. Ratterman ,  Brian E. Smith

Inventor： Charles J. Archer ,  Michael A. Blocksome ,  Joseph D. Ratterman ,  Brian E. Smith

IPC: G06F9/46 ,  G06F9/52

CPC classification number: G06F9/522 ,  G06F9/46 ,  G06F9/52 ,  G06F9/542 ,  G06F9/546 ,  G06F15/17318

Abstract: Executing computing tasks on a parallel computer that includes compute nodes coupled for data communications, where each compute node executes tasks, with one task on each compute node designated as a master task, including: for each task on each compute node until all master tasks have joined a global barrier: determining whether the task is a master task; if the task is not a master task, joining a single local barrier; if the task is a master task, joining the global barrier and the single local barrier only after all other tasks on the compute node have joined the single local barrier.

Abstract translation: 在并行计算机上执行计算任务，其中包括耦合用于数据通信的计算节点，其中每个计算节点执行任务，每个计算节点上指定为主任务的一个任务包括：对于每个计算节点上的每个任务，直到所有主任务具有 加入了全球壁垒：确定任务是否是主要任务; 如果任务不是主要任务，加入一个单一的局部障碍; 如果任务是主任务，则仅在计算节点上的所有其他任务已加入单个本地障碍之后才加入全局障碍和单个本地屏障。

公开(公告)号：US08909716B2

公开(公告)日：2014-12-09

申请号：US12892153

申请日：2010-09-28

Applicant: Charles J. Archer ,  Michael A. Blocksome ,  Joseph D. Ratterman ,  Brian E. Smith

Inventor： Charles J. Archer ,  Michael A. Blocksome ,  Joseph D. Ratterman ,  Brian E. Smith

IPC: G06F15/16

CPC classification number: G06F15/16

Abstract: Administering truncated receive functions in a parallel messaging interface (‘PMI’) of a parallel computer comprising a plurality of compute nodes coupled for data communications through the PMI and through a data communications network, including: sending, through the PMI on a source compute node, a quantity of data from the source compute node to a destination compute node; specifying, by an application on the destination compute node, a portion of the quantity of data to be received by the application on the destination compute node and a portion of the quantity of data to be discarded; receiving, by the PMI on the destination compute node, all of the quantity of data; providing, by the PMI on the destination compute node to the application on the destination compute node, only the portion of the quantity of data to be received by the application; and discarding, by the PMI on the destination compute node, the portion of the quantity of data to be discarded.

Abstract translation: 在并行计算机的并行消息接口（“PMI”）中管理截断的接收功能，所述并行计算机包括多个计算节点，所述计算节点被耦合用于通过所述PMI并通过数据通信网络进行数据通信，包括：通过源计算节点 ，从源计算节点到目的地计算节点的数据量; 由目的地计算节点上的应用指定要由目标计算节点上的应用接收的数据量的一部分和待丢弃的数据量的一部分; 由目标计算节点上的PMI接收所有数据量; 由目的地计算节点上的PMI向目标计算节点上的应用提供应用程序要接收的数据量的部分; 并且由目的地计算节点上的PMI舍弃待丢弃的数据量的部分。

公开(公告)号：US08825983B2

公开(公告)日：2014-09-02

申请号：US13027421

申请日：2011-02-15

Applicant: Michael A. Blocksome ,  Joseph D. Ratterman ,  Brian E. Smith

Inventor： Michael A. Blocksome ,  Joseph D. Ratterman ,  Brian E. Smith

IPC: G06F12/00

CPC classification number: G06F15/17337 ,  G06F12/109

Abstract: Eager send data communications in a parallel active messaging interface (‘PAMI’) of a parallel computer, the PAMI composed of data communications endpoints that specify a client, a context, and a task, including receiving an eager send data communications instruction with transfer data disposed in a send buffer characterized by a read/write send buffer memory address in a read/write virtual address space of the origin endpoint; determining for the send buffer a read-only send buffer memory address in a read-only virtual address space, the read-only virtual address space shared by both the origin endpoint and the target endpoint, with all frames of physical memory mapped to pages of virtual memory in the read-only virtual address space; and communicating by the origin endpoint to the target endpoint an eager send message header that includes the read-only send buffer memory address.

Abstract translation: 在并行计算机的并行活动消息接口（“PAMI”）中发送数据通信，由指定客户端，上下文和任务的数据通信端点组成的PAMI包括接收具有传送数据的热切发送数据通信指令 放置在发送缓冲器中，其特征在于在原点端点的读/写虚拟地址空间中具有读/写发送缓冲存储器地址; 为发送缓冲区确定只读虚拟地址空间中的只读发送缓冲存储器地址，原始端点和目标端点共享的只读虚拟地址空间，物理内存的所有帧映射到 只读虚拟地址空间中的虚拟内存; 并且由源端点与目标端点进行通信，其包括只读发送缓冲存储器地址的热切发送消息头。

公开(公告)号：US08656448B2

公开(公告)日：2014-02-18

申请号：US11553101

申请日：2006-10-26

Applicant: Charles J. Archer ,  Michael A. Blocksome ,  Joseph D. Ratterman ,  Albert Sidelnik ,  Brian E. Smith

Inventor： Charles J. Archer ,  Michael A. Blocksome ,  Joseph D. Ratterman ,  Albert Sidelnik ,  Brian E. Smith

IPC: H04L29/06

CPC classification number: G06F11/3447 ,  G06F11/3409

Abstract: Methods, apparatus, products are disclosed for providing policy-based application services to an application running on a computing system. The computing system includes at least one compute node. The compute node includes an application and a plurality of application services of a service type. Providing policy-based application services to an application running on a computing system includes establishing, on the compute node, a service policy specifying one of the application services of the service type for use by the application, establishing a performance ruleset, the performance ruleset specifying rules for analyzing the performance of the computing system, measuring performance of the computing system, and adjusting the service policy in dependence upon the performance ruleset and the measured performance. Providing policy-based application services to an application running on a computing system may also include accessing, by the application, the specified application service.

Abstract translation: 公开了用于向在计算系统上运行的应用程序提供基于策略的应用服务的方法，装置，产品。 计算系统包括至少一个计算节点。 计算节点包括服务类型的应用和多个应用服务。 向在计算系统上运行的应用提供基于策略的应用服务包括在计算节点上建立指定服务类型的应用服务之一以供应用使用的服务策略，建立性能规则集，指定性能规则集 用于分析计算系统的性能，衡量计算系统的性能以及根据性能规则集和测量性能调整服务策略的规则。 向运行在计算系统上的应用提供基于策略的应用服务也可以包括由应用访问指定的应用服务。

公开(公告)号：US20130304995A1

公开(公告)日：2013-11-14

申请号：US13470932

申请日：2012-05-14

Applicant: Charles J. Archer ,  Michael A. Blocksome ,  Joseph D. Ratterman ,  Brian E. Smith

Inventor： Charles J. Archer ,  Michael A. Blocksome ,  Joseph D. Ratterman ,  Brian E. Smith

IPC: G06F12/00

CPC classification number: G06F15/17325

Abstract: Methods, apparatuses, and computer program products for scheduling synchronization in association with collective operations in a parallel computer that includes a shared memory and a plurality of compute nodes that execute a parallel application utilizing the shared memory are provided. Embodiments include acquiring an available channel of the shared memory; posting to the acquired channel of the shared memory one or more collective operations and a synchronization point; determining that processing within the acquired channel has reached the synchronization point; and posting to the acquired channel, in response to determining that processing within the acquired channel has reached the synchronization point, a background synchronization operation corresponding to the one or more collective operations.

Abstract translation: 提供了用于在并行计算机中与集合操作相关联的用于调度同步的方法，装置和计算机程序产品，所述并行计算机包括共享存储器和使用所述共享存储器执行并行应用的多个计算节点。 实施例包括获取共享存储器的可用信道; 向共享存储器的获取通道发布一个或多个集合操作和同步点; 确定所获取的信道内的处理已经达到同步点; 并且响应于确定所获取的信道中的处理已经到达同步点，发布到获取的信道，对应于一个或多个集合操作的后台同步操作。

公开(公告)号：US08572629B2

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

申请号：US12963694

申请日：2010-12-09

Applicant: Charles J. Archer ,  Michael A. Blocksome ,  Joseph D. Ratterman ,  Brian E. Smith

Inventor： Charles J. Archer ,  Michael A. Blocksome ,  Joseph D. Ratterman ,  Brian E. Smith

IPC: G06F9/46

CPC classification number: G06F9/546

Abstract: Data communications in a parallel active messaging interface (‘PAMI’) of a parallel computer, the parallel computer including a plurality of compute nodes that execute a parallel application, the PAMI composed of data communications endpoints, each endpoint including a specification of data communications parameters for a thread of execution on a compute node, including specifications of a client, a context, and a task, the compute nodes and the endpoints coupled for data communications through the PAMI and through data communications resources, including receiving in an origin endpoint of the PAMI a data communications instruction, the instruction characterized by an instruction type, the instruction specifying a transmission of transfer data from the origin endpoint to a target endpoint and transmitting, in accordance with the instruction type, the transfer data from the origin endpoint to the target endpoint.

Abstract translation: 并行计算机的并行活动消息接口（“PAMI”）中的数据通信，并行计算机包括执行并行应用的多个计算节点，由数据通信端点组成的PAMI，每个端点包括数据通信参数的规范 对于在计算节点上执行的线程，包括客户端，上下文和任务的规范，所述计算节点和端点被耦合用于通过PAMI进行数据通信，并且通过数据通信资源，包括在源终端中接收 PAMI数据通信指令，以指令类型为特征的指令，指示传输数据从原始端点传输到目标端点的指令，并根据指令类型将传输数据从原点终端发送到目标 端点。

公开(公告)号：US08572276B2

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

申请号：US12769972

申请日：2010-04-29

Applicant: Charles J. Archer ,  Michael Blocksome ,  Bob R. Cernohous ,  Joseph D. Ratterman ,  Brian E. Smith

Inventor： Charles J. Archer ,  Michael Blocksome ,  Bob R. Cernohous ,  Joseph D. Ratterman ,  Brian E. Smith

IPC: G06F15/16

CPC classification number: G06F15/17318

Abstract: Systems, methods and articles of manufacture are disclosed for effecting a desired collective operation on a parallel computing system that includes multiple compute nodes. The compute nodes may pipeline multiple collective operations to effect the desired collective operation. To select protocols suitable for the multiple collective operations, the compute nodes may also perform additional collective operations. The compute nodes may pipeline the multiple collective operations and/or the additional collective operations to effect the desired collective operation more efficiently.

Abstract translation: 公开了系统，方法和制品，用于在包括多个计算节点的并行计算系统上实现期望的集体操作。 计算节点可以管理多个集合操作来实现所需的集体操作。 为了选择适合于多个集合操作的协议，计算节点还可以执行附加的集合操作。 计算节点可以管理多个集合操作和/或附加集合操作以更有效地实现期望的集体操作。