首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Some new designs of 2-D array for matrix multiplication and transitive closure
【24h】

Some new designs of 2-D array for matrix multiplication and transitive closure

机译:用于矩阵乘法和传递闭合的二维数组的一些新设计

获取原文
获取原文并翻译 | 示例

摘要

We present some new regular iterative algorithms for matrix multiplication and transitive closure. With these algorithms, by spacetime mapping the 2-D arrays with 2N-1 and upper bound [(3N-1)/2] execution times for matrix multiplication can be obtained. Meanwhile, we can derive a 2-D array with 4N-2 execution rime for transitive closure based on the sequential Warshall-Floyd algorithm. All these new 2-D arrays for matrix multiplication and transitive closure have the advantages of faster and more regular than other previous designs.
机译:我们为矩阵乘法和传递闭包提出了一些新的常规迭代算法。使用这些算法,通过时空映射具有2N-1和上限[(3N-1)/ 2]的二维数组,可以执行矩阵乘法。同时,我们可以基于顺序Warshall-Floyd算法导出具有4N-2执行边缘的2-D数组,用于传递闭合。所有这些用于矩阵乘法和传递闭合的新二维阵列都具有比其他先前设计更快,更规则的优点。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号