-
1.发明授权Paging memory from random access memory to backing storage in a parallel computer 失效将内存从随机访问内存分页到并行计算机中的后台存储公开(公告)号：US08447912B2
公开(公告)日：2013-05-21
申请号：US12892226
申请日：2010-09-28
申请人： Charles J. Archer , Michael A. Blocksome , Todd A. Inglett , Joseph D. Ratterman , Brian E. Smith
发明人： Charles J. Archer , Michael A. Blocksome , Todd A. Inglett , Joseph D. Ratterman , Brian E. Smith
IPC分类号： G06F12/00
CPC分类号： G06F12/0284 , G06F9/5016
摘要： Paging memory from random access memory (‘RAM’) to backing storage in a parallel computer that includes a plurality of compute nodes, including: executing a data processing application on a virtual machine operating system in a virtual machine on a first compute node; providing, by a second compute node, backing storage for the contents of RAM on the first compute node; and swapping, by the virtual machine operating system in the virtual machine on the first compute node, a page of memory from RAM on the first compute node to the backing storage on the second compute node.
摘要翻译： 将分页存储器从随机存取存储器（“RAM”）传送到包括多个计算节点的并行计算机中的存储器，包括：在第一计算节点上的虚拟机中的虚拟机操作系统上执行数据处理应用程序; 由第二计算节点提供第一计算节点上的RAM的内容的后备存储; 以及由第一计算节点上的虚拟机中的虚拟机操作系统将第一计算节点上的RAM的存储器页面交换到第二计算节点上的后备存储器。
-
2.发明授权Configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective networks 失效将操作组中的并行计算机的计算节点配置为多个独立的非重叠集合网络公开(公告)号：US07673011B2
公开(公告)日：2010-03-02
申请号：US11837015
申请日：2007-08-10
IPC分类号： G06F15/167 , G06F15/16 , G06F15/76
CPC分类号： G06F15/17337 , G06F9/5061 , G06F2209/5012
摘要： Methods, apparatus, and products are disclosed for configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective networks, the compute nodes in the operational group connected together for data communications through a global combining network, that include: partitioning the compute nodes in the operational group into a plurality of non-overlapping subgroups; designating one compute node from each of the non-overlapping subgroups as a master node; and assigning, to the compute nodes in each of the non-overlapping subgroups, class routing instructions that organize the compute nodes in that non-overlapping subgroup as a collective network such that the master node is a physical root.
摘要翻译： 公开了用于将操作组中的并行计算机的计算节点配置成多个独立的非重叠集合网络的方法，装置和产品，所述操作组中的计算节点通过全局组合网络连接在一起用于数据通信， 包括：将操作组中的计算节点划分成多个不重叠的子组; 将来自每个非重叠子组的一个计算节点指定为主节点; 以及将每个非重叠子组中的计算节点分配给将所述非重叠子组中的计算节点组织为集合网络的类路由指令，使得所述主节点是物理根。
-
公开(公告)号：US09569398B2
公开(公告)日：2017-02-14
申请号：US12892192
申请日：2010-09-28
申请人： Charles J. Archer , Michael A. Blocksome , Todd A. Inglett , Joseph D. Ratterman , Brian E. Smith
发明人： Charles J. Archer , Michael A. Blocksome , Todd A. Inglett , Joseph D. Ratterman , Brian E. Smith
IPC分类号： H04L12/701 , H04L29/08 , G06F9/455 , G06F15/173 , H04L12/781
CPC分类号： G06F15/17312 , G06F9/45558 , H04L45/52 , H04L67/327
摘要： Routing data communications packets in a parallel computer that includes compute nodes organized for collective operations. Each compute node including an operating system kernel and a system-level messaging module that is a module of automated computing machinery that exposes a messaging interface to applications. Each compute node including a routing table that specifies, for each of a multiplicity of route identifiers, a data communications path through the compute node. Including to carry out the steps of: receiving in a compute node a data communications packet that includes a route identifier value; retrieving from the routing table a specification of a data communications path through the compute node; and routing, by the compute node, the data communications packet according to the data communications path identified by the compute node's routing table entry for the data communications packet's route identifier value.
-
4.发明申请Paging Memory From Random Access Memory To Backing Storage In A Parallel Computer 失效从随机访问存储器寻呼内存到并行计算机中的存储公开(公告)号：US20120079165A1
公开(公告)日：2012-03-29
申请号：US12892226
申请日：2010-09-28
申请人： Charles J. Archer , Michael A. Blocksome , Todd A. Inglett , Joseph D. Ratterman , Brian E. Smith
发明人： Charles J. Archer , Michael A. Blocksome , Todd A. Inglett , Joseph D. Ratterman , Brian E. Smith
IPC分类号： G06F12/00
CPC分类号： G06F12/0284 , G06F9/5016
摘要： Paging memory from random access memory (‘RAM’) to backing storage in a parallel computer that includes a plurality of compute nodes, including: executing a data processing application on a virtual machine operating system in a virtual machine on a first compute node; providing, by a second compute node, backing storage for the contents of RAM on the first compute node; and swapping, by the virtual machine operating system in the virtual machine on the first compute node, a page of memory from RAM on the first compute node to the backing storage on the second compute node.
摘要翻译： 将分页存储器从随机存取存储器（“RAM”）传送到包括多个计算节点的并行计算机中的存储器，包括：在第一计算节点上的虚拟机中的虚拟机操作系统上执行数据处理应用程序; 通过第二计算节点为所述第一计算节点上的RAM的内容提供后备存储; 以及由第一计算节点上的虚拟机中的虚拟机操作系统将第一计算节点上的RAM的存储器页面交换到第二计算节点上的后备存储器。
-
5.发明申请公开(公告)号：US20090043988A1
公开(公告)日：2009-02-12
申请号：US11837015
申请日：2007-08-10
IPC分类号： G06F9/38
CPC分类号： G06F15/17337 , G06F9/5061 , G06F2209/5012
摘要： Methods, apparatus, and products are disclosed for configuring compute nodes of a parallel computer in an operational group into a plurality of independent non-overlapping collective networks, the compute nodes in the operational group connected together for data communications through a global combining network, that include: partitioning the compute nodes in the operational group into a plurality of non-overlapping subgroups; designating one compute node from each of the non-overlapping subgroups as a master node; and assigning, to the compute nodes in each of the non-overlapping subgroups, class routing instructions that organize the compute nodes in that non-overlapping subgroup as a collective network such that the master node is a physical root.
摘要翻译： 公开了用于将操作组中的并行计算机的计算节点配置成多个独立的非重叠集合网络的方法，装置和产品，操作组中的计算节点通过全局组合网络连接在一起用于数据通信， 包括：将操作组中的计算节点划分成多个不重叠的子组; 将来自每个非重叠子组的一个计算节点指定为主节点; 以及将每个非重叠子组中的计算节点分配给将所述非重叠子组中的计算节点组织为集合网络的类路由指令，使得所述主节点是物理根。
-
6.发明授权Providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer 失效在并行计算机的全局组合网络中的操作组的计算节点之间提供最近邻点点对点通信公开(公告)号：US08296457B2
公开(公告)日：2012-10-23
申请号：US11832955
申请日：2007-08-02
IPC分类号： G06F15/173 , G06F15/16 , G06F15/00 , G06Q10/00
CPC分类号： H04L45/302 , H04L45/00 , H04L45/06 , H04L45/48 , H04L45/60
摘要： Methods, apparatus, and products are disclosed for providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: identifying each link in the global combining network for each compute node of the operational group; designating one of a plurality of point-to-point class routing identifiers for each link such that no compute node in the operational group is connected to two adjacent compute nodes in the operational group with links designated for the same class routing identifiers; and configuring each compute node of the operational group for point-to-point communications with each adjacent compute node in the global combining network through the link between that compute node and that adjacent compute node using that link's designated class routing identifier.
摘要翻译： 公开了用于在并行计算机的全局组合网络中的操作组的计算节点之间提供最近邻点点对点通信的方法，装置和产品，每个计算节点连接到全局组合网络中的每个相邻计算节点，通过 链路，其包括：识别在操作组的每个计算节点的全局组合网络中的每个链路; 指定每个链路的多个点对点类路由标识符之一，使得所述操作组中的计算节点不与指定用于相同类路由标识符的链路连接到所述操作组中的两个相邻计算节点; 以及通过所述计算节点和所述相邻计算节点之间的链路使用所述链路的指定类路由标识符来配置所述操作组的每个计算节点，用于与所述全局组合网络中的每个相邻计算节点的点对点通信。
-
7.发明授权Providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer 失效在并行计算机的全局组合网络中的操作组的计算节点之间提供完整的点对点通信公开(公告)号：US08423663B2
公开(公告)日：2013-04-16
申请号：US11834159
申请日：2007-08-06
IPC分类号： G06F15/173 , G06F15/16 , H04L12/28 , H04L12/66 , H04L12/56
CPC分类号： H04L45/02 , G06F15/173
摘要： Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selected link to the adjacent compute node connected to the compute node through the selected link.
摘要翻译： 公开了用于在并行计算机的全局组合网络中的操作组的计算节点之间提供完整点对点通信的方法，装置和产品，每个计算节点通过以下方式连接到全局组合网络中的每个相邻计算节点 链路，其包括：在计算节点中接收网络分组，所述网络分组指定目的地计算节点; 根据所述目的地计算节点选择用于所述计算节点的至少一个所述链路，用于将所述网络分组转发到所述目的地计算节点; 以及沿着所选择的链路将所述网络分组转发到通过所选择的链路连接到所述计算节点的相邻计算节点。
-
8.发明申请Providing Nearest Neighbor Point-to-Point Communications Among Compute Nodes of an Operational Group in a Global Combining Network of a Parallel Computer 失效在并行计算机的全球组合网络中提供操作组的计算节点之间的最近邻点点对点通信公开(公告)号：US20090037598A1
公开(公告)日：2009-02-05
申请号：US11832955
申请日：2007-08-02
IPC分类号： G06F15/173
CPC分类号： H04L45/302 , H04L45/00 , H04L45/06 , H04L45/48 , H04L45/60
摘要： Methods, apparatus, and products are disclosed for providing nearest neighbor point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: identifying each link in the global combining network for each compute node of the operational group; designating one of a plurality of point-to-point class routing identifiers for each link such that no compute node in the operational group is connected to two adjacent compute nodes in the operational group with links designated for the same class routing identifiers; and configuring each compute node of the operational group for point-to-point communications with each adjacent compute node in the global combining network through the link between that compute node and that adjacent compute node using that link's designated class routing identifier.
摘要翻译： 公开了用于在并行计算机的全局组合网络中的操作组的计算节点之间提供最近邻点点对点通信的方法，装置和产品，每个计算节点连接到全局组合网络中的每个相邻计算节点，通过 链路，其包括：识别在操作组的每个计算节点的全局组合网络中的每个链路; 指定每个链路的多个点对点类路由标识符之一，使得操作组中的计算节点不与指定用于相同类路由标识符的链路连接到操作组中的两个相邻计算节点; 并且通过使用该链路的指定类路由标识符的该计算节点和该相邻计算节点之间的链路，配置操作组的每个计算节点，用于与全局组合网络中的每个相邻计算节点的点对点通信。
-
公开(公告)号：US09250948B2
公开(公告)日：2016-02-02
申请号：US13231326
申请日：2011-09-13
摘要： A parallel computer executes a number of tasks, each task includes a number of endpoints and the endpoints are configured to support collective operations. In such a parallel computer, establishing a group of endpoints receiving a user specification of a set of endpoints included in a global collection of endpoints, where the user specification defines the set in accordance with a predefined virtual representation of the endpoints, the predefined virtual representation is a data structure setting forth an organization of tasks and endpoints included in the global collection of endpoints and the user specification defines the set of endpoints without a user specification of a particular endpoint; and defining a group of endpoints in dependence upon the predefined virtual representation of the endpoints and the user specification.
摘要翻译： 并行计算机执行多个任务，每个任务包括多个端点，并且端点被配置为支持集合操作。 在这样的并行计算机中，建立一组端点，其接收包括在端点的全局集合中的一组端点的用户指定，其中用户规范根据端点的预定义虚拟表示来定义集合，预定义的虚拟表示 是阐述包括在全局端点集合中的任务和端点的组织的数据结构，并且用户规范定义了一组端点，而没有特定端点的用户指定; 并且根据端点的预定义虚拟表示和用户规范来定义一组端点。
-
公开(公告)号：US08949577B2
公开(公告)日：2015-02-03
申请号：US12789986
申请日：2010-05-28
IPC分类号： G06F9/46 , G06F15/173
CPC分类号： G06F15/17318
摘要： A parallel computer that includes compute nodes having computer processors and a CAU (Collectives Acceleration Unit) that couples processors to one another for data communications. In embodiments of the present invention, deterministic reduction operation include: organizing processors of the parallel computer and a CAU into a branched tree topology, where the CAU is a root of the branched tree topology and the processors are children of the root CAU; establishing a receive buffer that includes receive elements associated with processors and configured to store the associated processor's contribution data; receiving, in any order from the processors, each processor's contribution data; tracking receipt of each processor's contribution data; and reducing, the contribution data in a predefined order, only after receipt of contribution data from all processors in the branched tree topology.
-
-
-
-
-
-
-
-
-
搜索结果
240 条记录 (耗时 0.033 秒)
