猿代码 — 科研/AI模型/高性能计算
0

串行比并行慢得多,可能是数据局部性的问题

摘要: 1)原始的Maximum iterations ? 4000nLoc=5,nLength = 5Max error at iteration 2417 was 0.010000Total time was 46.905591 seconds.-----------------------------------2)Maximum iterations ? 4000nLoc = 2, nLe ...

1)原始的

Maximum iterations [100-4000]?  4000
nLoc=5,nLength = 5
Max error at iteration 2417 was 0.010000
Total time was 46.905591 seconds.
-----------------------------------

2)
Maximum iterations [100-4000]?  4000
nLoc = 2, nLength = 4, MPI number = 1
Max error at iteration 2766 was 0.009993
Total time was 49.700296 seconds.


Maximum iterations [100-4000]?  4000
nLoc = 2, nLength = 5, MPI number = 1
Max error at iteration 2765 was 0.009998
Total time was 49.808823 seconds.





说点什么...

已有0条评论

最新评论...

本文作者
2024-2-20 01:45
  • 0
    粉丝
  • 336
    阅读
  • 0
    回复
资讯幻灯片
热门评论
热门专题
排行榜
Copyright   ©2015-2023   猿代码-超算人才智造局 高性能计算|并行计算|人工智能      ( 京ICP备2021026424号-2 )