会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 32. 发明授权
    • Intranode data communications in a parallel computer
    • 并行计算机中的Intranode数据通信
    • US08495654B2
    • 2013-07-23
    • US13290670
    • 2011-11-07
    • Charles J. ArcherMichael A. BlocksomeDouglas R. MillerJoseph D. RattermanBrian E. Smith
    • Charles J. ArcherMichael A. BlocksomeDouglas R. MillerJoseph D. RattermanBrian E. Smith
    • G06F3/00G06F9/44G06F9/46G06F13/00
    • G06F9/544
    • Intranode data communications in a parallel computer that includes compute nodes configured to execute processes, where the data communications include: allocating, upon initialization of a first process of a compute node, a region of shared memory; establishing, by the first process, a predefined number of message buffers, each message buffer associated with a process to be initialized on the compute node; sending, to a second process on the same compute node, a data communications message without determining whether the second process has been initialized, including storing the data communications message in the message buffer of the second process; and upon initialization of the second process: retrieving, by the second process, a pointer to the second process's message buffer; and retrieving, by the second process from the second process's message buffer in dependence upon the pointer, the data communications message sent by the first process.
    • 并行计算机中的Intranode数据通信,其包括被配置为执行进程的计算节点,其中数据通信包括:在初始化计算节点的第一进程时分配共享存储器的区域; 通过第一进程建立预定数量的消息缓冲器,每个消息缓冲器与在计算节点上要初始化的进程相关联; 在同一计算节点上向第二进程发送数据通信消息,而不确定第二进程是否已被初始化,包括将数据通信消息存储在第二进程的消息缓冲器中; 并且在第二进程的初始化时:通过第二进程检索指向第二进程的消息缓冲器的指针; 以及根据所述指针,从所述第二进程的消息缓冲器中检索由所述第一进程发送的数据通信消息。
    • 33. 发明申请
    • Intranode Data Communications In A Parallel Computer
    • 并行计算机中的Intranode数据通信
    • US20130117761A1
    • 2013-05-09
    • US13290670
    • 2011-11-07
    • Charles J. ArcherMichael A. BlocksomeDouglas R. MillerJoseph D. RattermanBrian E. Smith
    • Charles J. ArcherMichael A. BlocksomeDouglas R. MillerJoseph D. RattermanBrian E. Smith
    • G06F9/50G06F3/00
    • G06F9/544
    • Intranode data communications in a parallel computer that includes compute nodes configured to execute processes, where the data communications include: allocating, upon initialization of a first process of a compute node, a region of shared memory; establishing, by the first process, a predefined number of message buffers, each message buffer associated with a process to be initialized on the compute node; sending, to a second process on the same compute node, a data communications message without determining whether the second process has been initialized, including storing the data communications message in the message buffer of the second process; and upon initialization of the second process: retrieving, by the second process, a pointer to the second process's message buffer; and retrieving, by the second process from the second process's message buffer in dependence upon the pointer, the data communications message sent by the first process.
    • 并行计算机中的Intranode数据通信,其包括被配置为执行进程的计算节点,其中数据通信包括:在初始化计算节点的第一进程时分配共享存储器的区域; 通过第一进程建立预定数量的消息缓冲器,每个消息缓冲器与在计算节点上要初始化的进程相关联; 在同一计算节点上向第二进程发送数据通信消息,而不确定第二进程是否已被初始化,包括将数据通信消息存储在第二进程的消息缓冲器中; 并且在第二进程的初始化时:通过第二进程检索指向第二进程的消息缓冲器的指针; 以及根据所述指针,从所述第二进程的消息缓冲器中检索由所述第一进程发送的数据通信消息。
    • 37. 发明申请
    • Data Communications In A Parallel Active Messaging Interface Of A Parallel Computer
    • 并行计算机并行主动消息接口中的数据通信
    • US20120185873A1
    • 2012-07-19
    • US13007860
    • 2011-01-17
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • G06F9/46
    • G06F15/17318G06F9/546
    • Data communications in a parallel active messaging interface (‘PAMI’) of a parallel computer composed of compute nodes that execute a parallel application, each compute node including application processors that execute the parallel application and at least one management processor dedicated to gathering information regarding data communications. The PAMI is composed of data communications endpoints, each endpoint composed of 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. Embodiments function by gathering call site statistics describing data communications resulting from execution of data communications instructions and identifying in dependence upon the call cite statistics a data communications algorithm for use in executing a data communications instruction at a call site in the parallel application.
    • 由执行并行应用的计算节点组成的并行计算机的并行主动消息接口(“PAMI”)中的数据通信,每个计算节点包括执行并行应用的应用处理器和专用于收集关于数据的信息的至少一个管理处理器 通讯。 PAMI由数据通信端点组成,每个端点由计算节点上的执行线程的数据通信参数的规范组成,包括客户端的规范,上下文和任务,计算节点和端点耦合 通过PAMI和数据通信资源进行数据通信。 实施例通过收集描述由执行数据通信指令而产生的数据通信的呼叫站点统计信息并根据呼叫引用统计信息识别用于在并行应用中的呼叫站点处执行数据通信指令的数据通信算法。
    • 38. 发明申请
    • Performing A Deterministic Reduction Operation In A Parallel Computer
    • 在并行计算机中执行确定性减少操作
    • US20110296139A1
    • 2011-12-01
    • US12790037
    • 2010-05-28
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • G06F9/30G06F9/02G06F15/76
    • G06F15/76G06F15/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减少处理器的贡献数据。
    • 39. 发明申请
    • Performing A Deterministic Reduction Operation In A Parallel Computer
    • 在并行计算机中执行确定性减少操作
    • US20110296137A1
    • 2011-12-01
    • US12789986
    • 2010-05-28
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • G06F15/76G06F15/80G06F9/02
    • 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的子节点; 建立接收缓冲器,其包括与处理器相关联的接收元件,并被配置为存储相关联的处理器的贡献数据; 以处理器的任何顺序接收每个处理器的贡献数据; 跟踪收到每个处理器的贡献数据; 并且仅在从分支树拓扑中的所有处理器接收到贡献数据之后,以预定义的顺序减少贡献数据。
    • 40. 发明申请
    • Effecting Hardware Acceleration Of Broadcast Operations In A Parallel Computer
    • 影响并行计算机中广播操作的硬件加速
    • US20110289177A1
    • 2011-11-24
    • US12782791
    • 2010-05-19
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • G06F15/173
    • 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操作,包括在指定用于接收目标节点的注入指令的存储器区域中存储将广播数据注入到后续目标的接收缓冲器中的指令 节点。