会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明授权
    • Fencing network direct memory access data transfers in a parallel active messaging interface of a parallel computer
    • 屏蔽网络直接存储器访问并行计算机的并行活动消息接口中的数据传输
    • US09081739B2
    • 2015-07-14
    • US13678799
    • 2012-11-16
    • INTERNATIONAL BUSINESS MACHINES CORPORATION
    • Michael A. BlocksomeAmith R. Mamidala
    • G06F15/16G06F15/173G06F7/38H04L29/06G06F9/54
    • G06F15/16G06F9/544G06F9/546G06F15/17331H04L67/40
    • Fencing direct memory access (‘DMA’) data transfers in a parallel active messaging interface (‘PAMI’) of a parallel computer, the PAMI including data communications endpoints, each endpoint including specifications of a client, a context, and a task, the endpoints coupled for data communications through the PAMI and through DMA controllers operatively coupled to a deterministic data communications network through which the DMA controllers deliver data communications deterministically, including initiating execution through the PAMI of an ordered sequence of active DMA instructions for DMA data transfers between two endpoints, effecting deterministic DMA data transfers through a DMA controller and the deterministic data communications network; and executing through the PAMI, with no FENCE accounting for DMA data transfers, an active FENCE instruction, the FENCE instruction completing execution only after completion of all DMA instructions initiated prior to execution of the FENCE instruction for DMA data transfers between the two endpoints.
    • 在并行计算机的并行活动消息接口(“PAMI”)中的屏蔽直接存储器访问(“DMA”)数据传输,PAMI包括数据通信端点,每个端点包括客户端的规范,上下文和任务, 通过PAMI和通过DMA控制器进行数据通信的端点,可操作地耦合到确定性数据通信网络,DMA控制器通过该确定性数据通信网络确定地传递数据通信,包括通过PAMI启动执行有序DMA指令的有序序列,以便在两个 端点,通过DMA控制器和确定性数据通信网络实现确定性DMA数据传输; 并且通过PAMI执行无FENCE计算DMA数据传输的有效FENCE指令,FENCE指令只有在完成在执行FENCE指令之前启动的所有DMA指令以完成执行,以在两个端点之间进行DMA数据传输。
    • 8. 发明授权
    • Performing a deterministic reduction operation in a parallel computer
    • 在并行计算机中执行确定性的还原操作
    • US08601237B2
    • 2013-12-03
    • US13672740
    • 2012-11-09
    • International Business Machines Corporation
    • Charles J. ArcherMichael A. BlocksomeJoseph D. RattermanBrian E. Smith
    • G06F15/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减少处理器的贡献数据。