首页> 外文会议>2011 International Conference on Consumer Electronics, Communications and Networks >Parallel research on matrix chain multiplication problem based on multi-core
【24h】

Parallel research on matrix chain multiplication problem based on multi-core

机译:基于多核的矩阵链乘法问题并行研究

获取原文

摘要

Now the computer is developing towards the multi-core and multi-CPU, but some quintessence serial algorithm can not be well transplanted to multi-core computer, so it's necessary to make parallel analysis and improvement on the original serial algorithm. This paper analyzes matrix chain multiplication problem, and gives three algorithms based on the multi-core and multi-CPU — parting matrix chain, balancing load among nucleuses, optimal algorithm at the initial stage, theoretically analyzing and implementing each one and getting good speedup.
机译:现在计算机正在向多核和多CPU发展,但是一些典型的串行算法无法很好地移植到多核计算机上,因此有必要对原始串行算法进行并行分析和改进。本文分析了矩阵链的乘法问题,给出了基于多核和多CPU的三种算法-矩阵矩阵分离,核间负载均衡,初始阶段的优化算法,理论分析和实现,并取得了良好的加速效果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号