首页> 外文会议>Parallel and Distributed Computing and Networks >RECURSIVE MULTI-FACTORING ALGORITHM FOR MPI_ALLREDUCE
【24h】

RECURSIVE MULTI-FACTORING ALGORITHM FOR MPI_ALLREDUCE

机译:MPI_ALLREDUCE的递归多因素算法

获取原文

摘要

This paper shows an effective all-reduction algorithm and its implementation on the Message Passing Interface. It performs comparatively stable in case not only composite numbers of processors but also prime numbers, since we introduce the process detachment strategy on each factorizing stage. On a preliminary test, we examine its efficiency, and we discuss and compare it with the existing algorithms by introducing a performance model of our algorithm.
机译:本文展示了一种有效的全约简算法及其在消息传递接口上的实现。由于我们在每个分解阶段都引入了流程分离策略,因此它不仅在处理器的复合数而且在质数的情况下都具有相对稳定的性能。在初步测试中,我们检查了它的效率,并通过介绍算法的性能模型来讨论它并与现有算法进行比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号