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

31. 发明申请

US20120079165A1 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的存储器页面交换到第二计算节点上的后备存储器。

32. 发明申请

US20110296139A1 Performing A Deterministic Reduction Operation In A Parallel Computer 失效
标题翻译：在并行计算机中执行确定性减少操作
公开(公告)号：US20110296139A1
公开(公告)日：2011-12-01
申请号：US12790037
申请日：2010-05-28
申请人： Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Brian E. Smith
发明人： Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Brian E. Smith
IPC分类号： G06F9/30 , G06F9/02 , G06F15/76
CPC分类号： G06F15/76 , G06F15/17318
摘要： Performing a deterministic reduction operation in a parallel computer that includes compute nodes, each of which includes computer processors and a CAU (Collectives Acceleration Unit) that couples computer processors to one another for data communications, including organizing processors and a CAU into a branched tree topology in which the CAU is a root and the processors are children; receiving, from each of the processors in any order, dummy contribution data, where each processor is restricted from sending any other data to the root CAU prior to receiving an acknowledgement of receipt from the root CAU; sending, by the root CAU to the processors in the branched tree topology, in a predefined order, acknowledgements of receipt of the dummy contribution data; receiving, by the root CAU from the processors in the predefined order, the processors' contribution data to the reduction operation; and reducing, by the root CAU, the processors' contribution data.
摘要翻译：在包括计算节点的并行计算机中执行确定性简化操作，每个节点包括计算机处理器和将计算机处理器彼此耦合以用于数据通信的CAU（集体加速单元），包括将处理器和CAU组织成分支树形拓扑其中CAU是根，处理器是孩子; 从每个处理器以任何顺序接收虚拟贡献数据，其中每个处理器在从根CAU接收到接收确认之前被限制不发送任何其他数据到根CAU; 由根CAU以分支树拓扑结构向处理器发送预定义的顺序，接收虚拟贡献数据的确认; 根据CAU从预定义的顺序从处理器接收处理器对减少操作的贡献数据; 并由根CAU减少处理器的贡献数据。

33. 发明申请

US20110296137A1 Performing A Deterministic Reduction Operation In A Parallel Computer 有权
标题翻译：在并行计算机中执行确定性减少操作
公开(公告)号：US20110296137A1
公开(公告)日：2011-12-01
申请号：US12789986
申请日：2010-05-28
申请人： Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Brian E. Smith
发明人： Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Brian E. Smith
IPC分类号： G06F15/76 , G06F15/80 , G06F9/02
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.
摘要翻译：包括具有计算机处理器的计算节点和将处理器彼此耦合用于数据通信的CAU（集体加速单元）的并行计算机。在本发明的实施例中，确定性减少操作包括：将并行计算机和CAU的处理器组织成分支树形拓扑，其中CAU是分支树形拓扑的根，并且处理器是根CAU的子节点; 建立接收缓冲器，其包括与处理器相关联的接收元件，并被配置为存储相关联的处理器的贡献数据; 以处理器的任何顺序接收每个处理器的贡献数据; 跟踪收到每个处理器的贡献数据; 并且仅在从分支树拓扑中的所有处理器接收到贡献数据之后，以预定义的顺序减少贡献数据。

34. 发明申请

US20110289177A1 Effecting Hardware Acceleration Of Broadcast Operations In A Parallel Computer 有权
标题翻译：影响并行计算机中广播操作的硬件加速
公开(公告)号：US20110289177A1
公开(公告)日：2011-11-24
申请号：US12782791
申请日：2010-05-19
申请人： Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Brian E. Smith
发明人： Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Brian E. Smith
IPC分类号： G06F15/173
CPC分类号： G06F15/17318
摘要： Compute nodes of a parallel computer organized for collective operations via a network, each compute node having a receive buffer and establishing a topology for the network; selecting a schedule for a broadcast operation; depositing, by a root node of the topology, broadcast data in a target node's receive buffer, including performing a DMA operation with a well-known memory location for the target node's receive buffer; depositing, by the root node in a memory region designated for storing broadcast data length, a length of the broadcast data, including performing a DMA operation with a well-known memory location of the broadcast data length memory region; and triggering, by the root node, the target node to perform a next DMA operation, including depositing, in a memory region designated for receiving injection instructions for the target node, an instruction to inject the broadcast data into the receive buffer of a subsequent target node.
摘要翻译：计算经由网络组织用于集体操作的并行计算机的节点，每个计算节点具有接收缓冲器并为网络建立拓扑; 选择广播操作的时间表; 通过拓扑的根节点存储在目标节点的接收缓冲器中的广播数据，包括用目标节点的接收缓冲器的公知存储器位置执行DMA操作; 通过根节点在指定用于存储广播数据长度的存储器区域中存储广播数据的长度，包括利用广播数据长度存储区域的公知存储器位置执行DMA操作; 并且由根节点触发目标节点执行下一个DMA操作，包括在指定用于接收目标节点的注入指令的存储器区域中存储将广播数据注入到后续目标的接收缓冲器中的指令节点。

35. 发明授权

US08032899B2 Providing policy-based operating system services in a hypervisor on a computing system 有权
标题翻译：在计算系统的管理程序中提供基于策略的操作系统服务
公开(公告)号：US08032899B2
公开(公告)日：2011-10-04
申请号：US11553077
申请日：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分类号： G06F15/163
CPC分类号： G06F9/5055 , G06F9/5077
摘要： Methods, apparatus, and products are disclosed for providing policy-based operating system services in a hypervisor on a computing system. The computing system includes at least one compute node. The compute node includes an operating system and a hypervisor. The operating system includes a kernel. The hypervisor comprising a kernel proxy and a plurality of operating system services of a service type. Providing policy-based operating system services in a hypervisor on a computing system includes establishing, on the compute node, a kernel policy specifying one of the operating system services of the service type for use by the kernel proxy, and accessing, by the kernel proxy, the specified operating system service. The computing system may also be implemented as a distributed computing system that includes one or more operating system service nodes. One or more of the operating system services may be distributed among the operating system service nodes.
摘要翻译：公开了用于在计算系统上的管理程序中提供基于策略的操作系统服务的方法，装置和产品。计算系统包括至少一个计算节点。计算节点包括操作系统和管理程序。操作系统包括内核。该管理程序包括内核代理和服务类型的多个操作系统服务。在计算系统的管理程序中提供基于策略的操作系统服务包括在计算节点上建立指定服务类型的操作系统服务之一以供内核代理使用的内核策略，以及由内核代理，指定的操作系统服务。计算系统还可以被实现为包括一个或多个操作系统服务节点的分布式计算系统。一个或多个操作系统服务可以分布在操作系统服务节点之间。

36. 发明申请

US20110239003A1 Direct Injection of Data To Be Transferred In A Hybrid Computing Environment 失效
标题翻译：直接注入要在混合计算环境中传输的数据
公开(公告)号：US20110239003A1
公开(公告)日：2011-09-29
申请号：US12748559
申请日：2010-03-29
申请人： Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Gary R. Ricard , Brian E. Smith
发明人： Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Gary R. Ricard , Brian E. Smith
IPC分类号： G06F12/08 , H03M13/09 , G06F12/14 , G06F11/10
CPC分类号： G06F9/5027 , G06F9/544 , G06F2209/509 , H03M13/09
摘要： Direct injection of a data to be transferred in a hybrid computing environment that includes a host computer and a plurality of accelerators, the host computer and the accelerators adapted to one another for data communications by a system level message passing module. Each accelerator includes a Power Processing Element (‘PPE’) and a plurality of Synergistic Processing Elements (‘SPEs’). Direct injection includes reserving, by each SPE, a slot in a shared memory region accessible by the host computer; loading, by each SPE into local memory of the SPE, a portion of data to be transferred to the host computer; executing, by each SPE in parallel, a data processing operation on the portion of the data loaded in local memory of each SPE; and writing, by each SPE, the processed data to the SPE's reserved slot in the shared memory region accessible by the host computer.
摘要翻译：在包括主计算机和多个加速器的混合计算环境中直接注入要传送的数据，所述主计算机和加速器彼此适配用于由系统级消息传递模块进行数据通信。每个加速器包括功率处理元件（“PPE”）和多个协同处理元件（“SPE”）。直接注入包括由每个SPE保留由主计算机可访问的共享存储器区域中的时隙; 将每个SPE加载到SPE的本地存储器中，将要传送到主机的一部分数据; 由每个SPE并行执行对每个SPE的本地存储器中加载的数据的部分的数据处理操作; 并且由每个SPE将处理的数据写入SPE主机计算机可访问的共享存储器区域中的保留时隙。

37. 发明申请

US20110238950A1 Performing A Scatterv Operation On A Hierarchical Tree Network Optimized For Collective Operations 失效
标题翻译：在集体行动优化的分层树网络上执行散度图操作
公开(公告)号：US20110238950A1
公开(公告)日：2011-09-29
申请号：US12748594
申请日：2010-03-29
申请人： Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Brian E. Smith
发明人： Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Brian E. Smith
IPC分类号： G06F15/76 , G06F9/06
CPC分类号： G06F15/17318
摘要： Performing a scattery operation on a hierarchical tree network optimized for collective operations including receiving, by the scattery module installed on the node, from a nearest neighbor parent above the node a chunk of data having at least a portion of data for the node; maintaining, by the scattery module installed on the node, the portion of the data for the node; determining, by the scattery module installed on the node, whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child; and sending, by the scattery module installed on the node, those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child.
摘要翻译：在针对集体操作优化的分级树网络上执行分散操作，包括由节点上安装的散布模块从节点上方的最近邻居父节点接收具有该节点的至少一部分数据的数据块; 通过安装在节点上的分散模块维护节点的数据部分; 通过安装在节点上的分散模块来确定数据的任何部分是否用于节点下方的特定最近邻孩子或特定最邻近子节点下方的一个或多个其他节点; 并且如果数据的任何部分用于节点下方的特定最近邻孩子或特定最近邻孩子下方的一个或多个其他节点，则将安装在节点上的散布模块发送到最近邻孩子的那些部分。

38. 发明授权

US07688737B2 Latency hiding message passing protocol 失效
标题翻译：延迟隐藏消息传递协议
公开(公告)号：US07688737B2
公开(公告)日：2010-03-30
申请号：US11682057
申请日：2007-03-05
申请人： Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Brian E. Smith
发明人： Charles J. Archer , Michael A. Blocksome , Joseph D. Ratterman , Brian E. Smith
IPC分类号： H04J1/16
CPC分类号： G06F9/546
摘要： A method, system, and article of manufacture that provide latency hiding, high bandwidth message passing protocols used for data communication between nodes of a parallel computer system are disclosed. A source node transmits a request to send message to a receiving node. Prior to receiving a clear to send message, the sending node continues to send deterministically routed (or fully described) data packets to the receiving node, thereby hiding the latency inherent in the request to send—clear to send message exchange. Once the sending node receives the clear to send message, any remaining portion of the message may be sent using partially described packets which may be routed dynamically, thereby maximizing bandwidth.
摘要翻译：公开了一种提供延迟隐藏，用于并行计算机系统的节点之间的数据通信的高带宽消息传递协议的方法，系统和制品。源节点向接收节点发送发送消息的请求。在接收到清除发送消息之前，发送节点继续向接收节点发送确定性路由（或完全描述）的数据分组，从而隐藏请求中固有的等待发送清除以发送消息交换。一旦发送节点接收到清除发送消息，消息的任何剩余部分可以使用可以动态路由的部分描述的分组来发送，从而最大化带宽。

39. 发明申请

US20090307708A1 Thread Selection During Context Switching On A Plurality Of Compute Nodes 失效
标题翻译：在多个计算节点的上下文切换期间的线程选择
公开(公告)号：US20090307708A1
公开(公告)日：2009-12-10
申请号：US12135604
申请日：2008-06-09
申请人： Charles J. Archer , Michael A. Blocksome , Amanda E. Peters , Joseph D. Ratterman , Brian E. Smith
发明人： Charles J. Archer , Michael A. Blocksome , Amanda E. Peters , Joseph D. Ratterman , Brian E. Smith
IPC分类号： G06F9/46 , G06F1/26
CPC分类号： G06F9/4893 , G06F1/3203 , G06F1/329 , G06F9/46 , G06F9/48 , G06F9/5027 , G06F9/5094 , G06F2209/5018 , Y02D10/22 , Y02D10/24
摘要： Methods, apparatus, and products are disclosed for thread selection during context switching on a plurality of compute nodes that includes: executing, by a compute node, an application using a plurality of threads of execution, including executing one or more of the threads of execution; selecting, by the compute node from a plurality of available threads of execution for the application, a next thread of execution in dependence upon power characteristics for each of the available threads; determining, by the compute node, whether criteria for a thread context switch are satisfied; and performing, by the compute node, the thread context switch if the criteria for a thread context switch are satisfied, including executing the next thread of execution.
摘要翻译：公开了在多个计算节点上下文切换期间的线程选择的方法，装置和产品，其包括：使用多个执行线程由计算节点执行应用，包括执行一个或多个执行线程 ; 由计算节点从应用程序的多个可用执行线程中选择依赖于每个可用线程的功率特性的下一个执行线程; 由计算节点确定是否满足线程上下文切换的准则; 以及如果满足线程上下文切换的标准，则由计算节点执行线程上下文切换，包括执行下一个执行线程。

40. 发明申请

US20090300399A1 Profiling power consumption of a plurality of compute nodes while processing an application 审中-公开
标题翻译：在处理应用程序时分析多个计算节点的功耗
公开(公告)号：US20090300399A1
公开(公告)日：2009-12-03
申请号：US12129205
申请日：2008-05-29
申请人： Charles J. Archer , Michael A. Blocksome , Amanda E. Peters , Joseph D. Ratterman , Brian E. Smith
发明人： Charles J. Archer , Michael A. Blocksome , Amanda E. Peters , Joseph D. Ratterman , Brian E. Smith
IPC分类号： G06F1/26 , G06F11/30
CPC分类号： G06F11/30 , G06F11/3409 , G06F11/3466 , Y02D10/34
摘要： Methods, apparatus, and products are disclosed for profiling power consumption of a plurality of compute nodes while processing an application that include: executing the application on the plurality of compute nodes; monitoring performance characteristics for components of the plurality of compute nodes during execution of the application; and recording, in a power profile for the application, power consumption during execution of the application in dependence upon the performance characteristics for components of the plurality of compute nodes.
摘要翻译：公开了方法，装置和产品，用于在处理包括在多个计算节点上执行应用程序的应用程序时对多个计算节点的功耗进行分析; 在所述应用执行期间监视所述多个计算节点的组件的性能特征; 以及根据所述多个计算节点的组件的性能特征，在所述应用的功率分布中记录所述应用执行期间的功率消耗。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式