MPI + FORTRAN 数据的收集测试

最新推荐文章于 2025-11-16 12:55:10 发布

原创最新推荐文章于 2025-11-16 12:55:10 发布 · 9.7k 阅读

2 ·

CC 4.0 BY-SA版权

文章标签：

#fortran #integer #domain #ie #file #测试

MPI 同时被 2 个专栏收录

29 篇文章

订阅专栏

FORTRAN

21 篇文章

订阅专栏

本文介绍了一个使用MPI实现的并行计算示例，通过将三维数组ufew沿K方向分段，分配给不同进程进行计算，并最终汇总结果到指定进程。此程序展示了基本的并行计算技术和阻塞式通信。

1、将一个三维数组ufew的计算域[ib:ie, jb:je, kb:ke]沿K方向分段，各进程均分计算域，然后对各自计算域内的部分数组赋值。
2、最后一个进程，收集各个计算域的值，最后输出，消息传递采用标准的阻塞式通信。
3、本程序中，每个进程都拥有完整的数组ufew。

program main implicit none include 'mpif.h' integer i,j,k,nn integer ib,ie,jb,je,kb,ke integer, parameter::imax=30,jmax=30,kmax=200, & in=8,jn=8,kn=30,total = imax*jmax integer ufew(imax,jmax,kmax),temp(imax,jmax,kmax) integer myid, numprocs, ierr integer dp(0:kmax), delta, myleft, myright, ind, sender integer REQ(16), STATUS(MPI_STATUS_SIZE) call MPI_INIT(ierr) call MPI_COMM_RANK(MPI_COMM_WORLD, myid, ierr) call MPI_COMM_SIZE(MPI_COMM_WORLD, numprocs, ierr) ! global computing domain [ib:ie,jb:je,kb:ke] ib=3 ie=in-1 jb=3 je=jn-1 kb=3 ke=kn-1 ! partition the Computing domain from the direction of K delta = (ke-kb+1) / numprocs dp(0) = kb do i = 1, numprocs dp(i) = dp(i-1) + delta enddo dp(numprocs) = ke myleft = myid - 1 myright = myid + 1 if(myleft.eq.(-1)) then myleft = MPI_PROC_NULL endif if(myright.eq.numprocs) then myright = MPI_PROC_NULL endif kb = dp(myid) ke = dp(myid+1) - 1 if(myid.eq.numprocs-1) then ke = ke +1 endif ! write(*,*) '[',kb,'-----------------------',ke,']' ! set values for local computing domain [ib:ie,jb:je,kb:ke] do 23 i=ib,ie do 23 j=jb,je do 23 k=kb,ke ufew(i,j,k)=myid+10 23 continue ! write lacal values into files open(100,file='dat') do k=kb,ke write(100,*) '---------------------------------------' do i=ib,ie write(100,*) ufew(i,jb:je,k) enddo write(100,*) enddo close(100) ! gather local values at process numprocs-1 if(myid.ne.(numprocs-1)) then call MPI_send(ufew(1,1,kb),total*delta,MPI_INTEGER, & numprocs-1,96,MPI_COMM_WORLD,IERR) endif if(myid.eq.(numprocs-1)) then do nn = 1, numprocs-1 call MPI_recv(temp(1,1,1),total*delta,MPI_INTEGER, & MPI_ANY_SOURCE,96,MPI_COMM_WORLD,status,IERR) sender = status(MPI_SOURCE) kb = dp(sender) ke = dp(sender+1) - 1 ind = 1 do k = kb,ke do j = 1,jmax do i = 1,imax ufew(i,j,k) = temp(i,j,ind) enddo enddo ind = ind + 1 enddo enddo endif ib=3 ie=in-1 jb=3 je=jn-1 kb=3 ke=kn-1 ! output if(myid.eq.(numprocs-1)) then ! open(100,file='dat.dat') do k=kb,ke write(*,*) '---------------------------------------' do i=ib,ie write(*,*) ufew(i,jb:je,k) enddo write(*,*) enddo ! close(100) endif call MPI_FINALIZE(ierr) end

result:

[root@c0108 ~]# mpiexec -n 6 ./simple --------------------------------------- 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 --------------------------------------- 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 --------------------------------------- 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 --------------------------------------- 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 --------------------------------------- 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 --------------------------------------- 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 --------------------------------------- 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 --------------------------------------- 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 --------------------------------------- 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 --------------------------------------- 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 --------------------------------------- 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 --------------------------------------- 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 12 --------------------------------------- 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 --------------------------------------- 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 --------------------------------------- 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 --------------------------------------- 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 --------------------------------------- 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 --------------------------------------- 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 --------------------------------------- 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 --------------------------------------- 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 --------------------------------------- 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 --------------------------------------- 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 --------------------------------------- 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 --------------------------------------- 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 --------------------------------------- 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 --------------------------------------- 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 --------------------------------------- 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 [root@c0108 ~]#