专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

91. 发明申请

US20090040946A1 Executing an Allgather Operation on a Parallel Computer 审中-公开
标题翻译：在并行计算机上执行Allgather操作
公开(公告)号：US20090040946A1
公开(公告)日：2009-02-12
申请号：US11834153
申请日：2007-08-06
申请人： Charles J. Archer , Ahmad A. Faraj
发明人： Charles J. Archer , Ahmad A. Faraj
IPC分类号： H04L12/28
CPC分类号： H04L12/42 , H04L45/02 , H04L45/48
摘要： Methods, apparatus, and products are disclosed for executing an allgather operation on a parallel computer that includes a plurality of compute nodes organized into at least one operational group of compute nodes for collective parallel operations, each compute node in the operational group assigned a unique rank, that includes: determining a contention-free logical ring topology for the compute nodes in the operational group; configuring, for each compute node in the operational group according to the contention-free logical ring topology, a routing table to specify a forwarding path to the next compute node in the logical ring topology; and repeatedly, for each compute node in the operational group until each compute node has received contributions for all of the other compute nodes in the operational group, forwarding a contribution for the allgather operation to the next compute node in the logical ring topology along the forwarding path.
摘要翻译：公开了用于在并行计算机上执行整套操作的方法，装置和产品，该并行计算机包括被组织成用于集体并行操作的计算节点的至少一个操作组的多个计算节点，操作组中的每个计算节点分配了唯一的等级，其包括：为操作组中的计算节点确定无竞争逻辑环形拓扑; 根据无竞争逻辑环形拓扑为每个运算组中的每个计算节点配置路由表，以指定到逻辑环形拓扑中下一个计算节点的转发路径; 并且重复地，对于操作组中的每个计算节点，直到每个计算节点已经为操作组中的所有其他计算节点接收到贡献，将所有所有操作的贡献转发到沿着转发的逻辑环形拓扑中的下一个计算节点路径。

92. 发明申请

US20090037598A1 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
申请人： Charles J. Archer , Ahmad A. Faraj , Todd A. Inglett , Joseph D. Ratterman
发明人： Charles J. Archer , Ahmad A. Faraj , Todd A. Inglett , Joseph D. Ratterman
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.
摘要翻译：公开了用于在并行计算机的全局组合网络中的操作组的计算节点之间提供最近邻点点对点通信的方法，装置和产品，每个计算节点连接到全局组合网络中的每个相邻计算节点，通过链路，其包括：识别在操作组的每个计算节点的全局组合网络中的每个链路; 指定每个链路的多个点对点类路由标识符之一，使得操作组中的计算节点不与指定用于相同类路由标识符的链路连接到操作组中的两个相邻计算节点; 并且通过使用该链路的指定类路由标识符的该计算节点和该相邻计算节点之间的链路，配置操作组的每个计算节点，用于与全局组合网络中的每个相邻计算节点的点对点通信。

93. 发明申请

US20080307195A1 Parallel, Low-Latency Method for High-Performance Speculative Element Extraction From Distributed Arrays 有权
标题翻译：用于从分布式阵列提取高性能投机元素的并行，低延迟方法
公开(公告)号：US20080307195A1
公开(公告)日：2008-12-11
申请号：US11758703
申请日：2007-06-06
申请人： Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Brian Smith
发明人： Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Brian Smith
IPC分类号： G06F15/00
CPC分类号： G06F7/36 , G06F9/30021 , G06F9/30032 , G06F9/3885 , G06F15/80 , G06F19/16 , G06F19/28
摘要： The present invention provides a system and method for extracting elements from distributed arrays on a parallel processing system. The system includes a module that populates a result array with globally largest elements from the input, a module that generates a partition element, a module that counts the number of local elements greater than the partition and a module that determines the globally largest elements. The method for extracting elements from distributed arrays on a parallel processing system includes populating a result array with globally largest elements from the input, generating a partition element, counting the number of local elements greater than the partition and determining the globally largest elements.
摘要翻译：本发明提供了一种用于从并行处理系统中的分布式阵列中提取元素的系统和方法。该系统包括一个模块，该模块使用输入中的全局最大元素填充结果数组，生成分区元素的模块，计算大于分区的本地元素数量的模块以及确定全局最大元素的模块。用于从并行处理系统中的分布式阵列中提取元素的方法包括从输入中填充具有全局最大元素的结果数组，生成分区元素，对大于分区的局部元素数进行计数，并确定全局最大元素。

94. 发明申请

US20080267066A1 Remote Direct Memory Access 有权
标题翻译：远程直接内存访问
公开(公告)号：US20080267066A1
公开(公告)日：2008-10-30
申请号：US11740361
申请日：2007-04-26
申请人： Charles J. Archer , Michael A. Blocksome
发明人： Charles J. Archer , Michael A. Blocksome
IPC分类号： H04B7/204
CPC分类号： G06F13/28
摘要： Methods, parallel computers, and computer program products are disclosed for remote direct memory access. Embodiments include transmitting, from an origin DMA engine on an origin compute node to a plurality target DMA engines on target compute nodes, a request to send message, the request to send message specifying a data to be transferred from the origin DMA engine to data storage on each target compute node; receiving, by each target DMA engine on each target compute node, the request to send message; preparing, by each target DMA engine, to store data according to the data storage reference and the data length, including assigning a base storage address for the data storage reference; sending, by one or more of the target DMA engines, an acknowledgment message acknowledging that all the target DMA engines are prepared to receive a data transmission from the origin DMA engine; receiving, by the origin DMA engine, the acknowledgement message from the one or more of the target DMA engines; and transferring, by the origin DMA engine, data to data storage on each of the target compute nodes according to the data storage reference using a single direct put operation.
摘要翻译：公开了用于远程直接存储器访问的方法，并行计算机和计算机程序产品。实施例包括从源计算节点上的原始DMA引擎向目标计算节点上的多个目标DMA引擎发送发送消息的请求，发送消息的请求，该消息指定要从原始DMA引擎传输的数据到数据存储在每个目标计算节点上; 由每个目标计算节点上的每个目标DMA引擎接收发送消息的请求; 通过每个目标DMA引擎准备根据数据存储参考和数据长度存储数据，包括分配用于数据存储参考的基本存储地址; 由一个或多个目标DMA引擎发送确认消息，确认所有目标DMA引擎准备好从原始DMA引擎接收数据传输; 由原始DMA引擎从一个或多个目标DMA引擎接收确认消息; 并且由原始DMA引擎使用单个直接放置操作根据数据存储参考将数据传送到每个目标计算节点上的数据存储。

95. 发明申请

US20080104452A1 Providing Policy-Based Application Services to an Application Running on a Computing System 失效
标题翻译：向运行在计算系统上的应用程序提供基于策略的应用程序服务
公开(公告)号：US20080104452A1
公开(公告)日：2008-05-01
申请号：US11553101
申请日：2006-10-26
申请人： Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Albert Sidelnik , Brian E. Smith
发明人： Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Albert Sidelnik , Brian E. Smith
IPC分类号： H04L9/00 , G06F11/00 , G06F17/00 , H04K1/00
CPC分类号： G06F11/3447 , G06F11/3409
摘要： 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.
摘要翻译：公开了用于向在计算系统上运行的应用程序提供基于策略的应用服务的方法，装置，产品。计算系统包括至少一个计算节点。计算节点包括服务类型的应用和多个应用服务。向在计算系统上运行的应用提供基于策略的应用服务包括在计算节点上建立指定服务类型的应用服务之一以供应用使用的服务策略，建立性能规则集，指定性能规则集用于分析计算系统的性能，衡量计算系统的性能以及根据性能规则集和测量性能调整服务策略的规则。向运行在计算系统上的应用提供基于策略的应用服务也可以包括由应用访问指定的应用服务。

96. 发明申请

US20080059555A1 PARALLEL APPLICATION LOAD BALANCING AND DISTRIBUTED WORK MANAGEMENT 有权
标题翻译：并行应用负载平衡和分布式工作管理
公开(公告)号：US20080059555A1
公开(公告)日：2008-03-06
申请号：US11469107
申请日：2006-08-31
申请人： Charles J. Archer , Timothy J. Mullins , Joseph D. Ratterman , Albert Sidelnik , Brian E. Smith
发明人： Charles J. Archer , Timothy J. Mullins , Joseph D. Ratterman , Albert Sidelnik , Brian E. Smith
IPC分类号： G06F15/16
CPC分类号： G06F9/5027 , G06F2209/5011
摘要： Embodiments of the invention provide a method, system and article of manufacture for parallel application load balancing and distributed work management. In one embodiment, a hierarchy of master nodes may be used to coordinate the actions of pools of worker nodes. Further, the activity of the master nodes may be controlled by a “coordinator” node. A coordinator node may be configured to distribute work unit descriptions to the collection of master nodes. If needed, embodiments of the invention may be scaled to deeper hierarchies.
摘要翻译：本发明的实施例提供了用于并行应用负载平衡和分布式工作管理的方法，系统和制造。在一个实施例中，可以使用主节点的层次来协调工作节点的池的动作。此外，主节点的活动可以由“协调器”节点控制。协调器节点可以被配置为将工作单元描述分发到主节点的集合。如果需要，本发明的实施例可以被缩放到更深层次。

97. 发明授权

US09720676B2 Implementing updates to source code executing on a plurality of compute nodes 有权
公开(公告)号：US09720676B2
公开(公告)日：2017-08-01
申请号：US13369879
申请日：2012-02-09
申请人： Charles J. Archer , James E. Carey , Matthew R. Weaver
发明人： Charles J. Archer , James E. Carey , Matthew R. Weaver
IPC分类号： G06F9/45 , G06F9/445 , G06F9/52
CPC分类号： G06F8/65 , G06F8/656 , G06F9/522
摘要： Methods, apparatuses, and computer program products for implementing updates to source code executing on a plurality of compute nodes are provided. Embodiments include receiving, by a compute node, a broadcast update-notification message indicating there is an update to the source code executing on the plurality of compute nodes; in response to receiving the update-notification message, implementing a distributed barrier; based on the distributed barrier, halting execution of the source code at a particular location within the source code; based on the distributed barrier, updating in-place the source code including retaining workpiece data in memory of the compute node, the workpiece data corresponding to the execution of the source code; and based on completion of the updating of the source code, resuming with the retained workpiece data execution of the source code at the particular location within the source code where execution was halted.

98. 发明授权

US09448850B2 Discovering a resource in a distributed computing system 有权
标题翻译：在分布式计算系统中发现资源
公开(公告)号：US09448850B2
公开(公告)日：2016-09-20
申请号：US12722107
申请日：2010-03-11
申请人： Charles J. Archer , James E. Carey , Matthew W. Markland , Philip J. Sanders
发明人： Charles J. Archer , James E. Carey , Matthew W. Markland , Philip J. Sanders
IPC分类号： G06F15/16 , G06F9/50
CPC分类号： G06F9/5061
摘要： Sending, by a node requesting information regarding a resource to one or more nodes in a distributed computing system, an active message to perform a collective operation; contributing, by each node not having a resource, a value of zero to the collective operation; contributing, by a node having the resource, the node's rank; storing the result of the collective operation in a buffer of the requesting node; and identifying, in dependence upon the result of the collective operation, the rank of the node having the resource.
摘要翻译：通过向分布式计算系统中的一个或多个节点请求关于资源的信息的节点发送用于执行集体操作的活动消息; 每个不具有资源的节点对集体操作的值为零; 由具有资源的节点贡献节点的等级; 将所述集合操作的结果存储在请求节点的缓冲器中; 并且根据集体操作的结果识别具有资源的节点的等级。

99. 发明授权

US09348661B2 Assigning a unique identifier to a communicator 有权
标题翻译：为通信者分配唯一的标识符
公开(公告)号：US09348661B2
公开(公告)日：2016-05-24
申请号：US12721981
申请日：2010-03-11
申请人： Charles J. Archer , James E. Carey , Matthew W. Markland , Philip J. Sanders
发明人： Charles J. Archer , James E. Carey , Matthew W. Markland , Philip J. Sanders
IPC分类号： G06F15/16 , G06F9/54
CPC分类号： G06F9/54
摘要： Creating, by a parent master process of a parent communicator, a child communicator, including configuring the child communicator with a child master process, wherein a communicator includes a collection of one or more processes executing on compute nodes of a distributed computing system; determining, by the parent master process, whether a unique identifier is available to assign to the child communicator; if a unique identifier is available to assign to the child communicator, assigning, by the parent master process, the available unique identifier to the child communicator; and if a unique identifier is not available to assign to the child communicator: retrieving, by the parent master process, an available unique identifier from a master process of another communicator in a tree of communicators and assigning the retrieved unique identifier to the child communicator.
摘要翻译：通过父通信器的父母主进程创建子通信器，包括用子主进程配置子通信器，其中通信器包括在分布式计算系统的计算节点上执行的一个或多个进程的集合; 由父主进程确定唯一标识符是否可用于分配给子通信器; 如果唯一标识符可用于分配给子通信器，则由父主进程将可用的唯一标识符分配给子通信器; 并且如果唯一标识符不可用于分配给子通信器：由父主进程从通信器树中的另一通信器的主进程检索可用的唯一标识符，并将所检索的唯一标识符分配给子通信器。

100. 发明授权

US09330230B2 Validating a cabling topology in a distributed computing system 有权
标题翻译：验证分布式计算系统中的布线拓扑
公开(公告)号：US09330230B2
公开(公告)日：2016-05-03
申请号：US11737229
申请日：2007-04-19
申请人： Charles J. Archer , Mark G. Megerian
发明人： Charles J. Archer , Mark G. Megerian
IPC分类号： G06F15/173 , G06F17/50
CPC分类号： G06F17/509 , G06F2217/36 , G06F2217/74
摘要： Validating a cabling topology in a distributed computing system comprised of cabled nodes connected using data communications cables, each cabled node characterized by cabling dimensions, each cable corresponding to one of the cabling dimensions, includes: receiving a selection from a user of at least one cabled node for topology validation; identifying, for each cabling dimension for each selected cabled node, a shortest cabling path; determining, for each cabling dimension, whether the number of cabled nodes in the shortest cabling path for each selected cabled node match; and if, for each cabling dimension, the number of cabled nodes in the shortest cabling path for each selected cabled node match: selecting, for each cabling dimension, the number of cabled nodes in the shortest cabling path as a representative value for the cabling dimension, calculating a product of the representative values, and determining whether the product equals the number of selected cabled nodes.
摘要翻译：在包括由数据通信电缆连接的有线节点组成的分布式计算系统中验证布线拓扑，每个电缆节点的特征在于布线尺寸，每个电缆对应于布线尺寸之一，包括：从至少一个电缆的用户接收选择节点进行拓扑验证; 为每个选定的有线节点的每个布线维度确定最短布线路径; 对于每个布线维度，确定每个所选择的有线节点的最短布线路径中的有线节点的数量是否匹配; 并且对于每个布线维度，如果针对每个布线维度，每个选择的有线节点的最短布线路径中的有线节点的数量匹配：对于每个布线维度，选择最短布线路径中的有线节点的数量作为布线维度的代表值，计算代表值的乘积，以及确定乘积等于所选择的有线节点的数量。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式