首页> 外国专利> Performing a deterministic reduction operation in a compute node organized into a branched tree topology

Performing a deterministic reduction operation in a compute node organized into a branched tree topology

机译:在组织成分支树拓扑的计算节点中执行确定性约简操作

摘要

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减少处理器的贡献数据。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号