【问题标题】:MPI master process convergence loopMPI主进程收敛循环
【发布时间】:2019-11-29 21:31:36
【问题描述】:

我正在尝试编写一个 MPI 程序来模拟整个网格的温度流动以达到平衡。我已经使用 openMP pthreads 和 cuda 编写了串行版本和并行版本。

我的目标是并行化一个为一维数组计算更新温度值的 for 循环。我必须做并行部分的代码在这里(所有其他变量都在上面初始化):

int nproc, rank,chunksize,leftover,offset,source, tag1=3,tag2=2,tag3=1;

    MPI_Status status;
    MPI_Init(&argc,&argv);
    MPI_Comm_size(MPI_COMM_WORLD,&nproc);
    MPI_Comm_rank(MPI_COMM_WORLD,&rank);
    chunksize = (boxes / (nproc-1));
    leftover = (boxes % (nproc-1));
    if(rank == 0){

        //init dsv
        for(int idx = 0; idx < boxes; idx++){
            temps[idx] = newtemps[idx];
        }

        int stop = 0;
        int iter = 0;
        float max_tmp;
        float min_tmp;

        while(stop != 1){
            offset = 0;
            for (int dest=1; dest<nproc; dest++) {
                int chunk = (dest <= leftover ? chunksize + 1 : chunksize);
                MPI_Send(&offset, 1, MPI_INT, dest, tag1, MPI_COMM_WORLD);
                MPI_Send(&temps[offset], chunk, MPI_FLOAT, dest, tag2, MPI_COMM_WORLD);
                MPI_Send(&newtemps[offset], chunk, MPI_FLOAT, dest, tag3, MPI_COMM_WORLD);
                printf("sent %d temps to process: %d\n",chunk, dest);
                offset = offset + chunk;
            }
            for (int dest=1; dest<nproc; dest++) {
                int chunk = (dest <= leftover ? chunksize + 1 : chunksize);
                MPI_Recv(&offset, 1, MPI_INT, dest, tag1, MPI_COMM_WORLD, &status);
                MPI_Recv(&temps[offset], chunk, MPI_FLOAT, dest, tag2, MPI_COMM_WORLD,&status);
                MPI_Recv(&newtemps[offset], chunk, MPI_FLOAT, dest, tag3, MPI_COMM_WORLD,&status);
                printf("received %d temps from process: %d\n",chunk, dest);
                printf("status: %d\n",status.MPI_TAG);

            }

            max_tmp = -10000;
            min_tmp =  10000;
            for(idx = 0; idx < boxes; idx++){
                temps[idx] = newtemps[idx];
                if(newtemps[idx] > max_tmp){
                    max_tmp = newtemps[idx];
                }
                if(newtemps[idx] < min_tmp){
                    min_tmp = newtemps[idx];
                }
            }
            stop = (max_tmp - min_tmp) <= (max_tmp * epsilon);
            iter += 1;
        }
    }
    if (rank > 0){
        int chunk = (rank <= leftover ? chunksize + 1 : chunksize);
        MPI_Recv(&offset, 1, MPI_INT, 0, tag1, MPI_COMM_WORLD, &status);
        MPI_Recv(&temps[offset], chunk, MPI_FLOAT, 0, tag2, MPI_COMM_WORLD,&status);
        MPI_Recv(&newtemps[offset], chunk, MPI_FLOAT, 0, tag3, MPI_COMM_WORLD,&status);
        printf("received %d temps from process: 0\n",chunk);
        printf("status: %d\n",status.MPI_TAG);

        for(int j = offset; j < offset+chunk; j++){
            float weightedtmp = 0;
            int perimeter = 0;
            int num_iters = neighbors[j][0];
            for(int i = 1; i <= num_iters; i++){
                weightedtmp += temps[neighbors[j][i]] * mults[j][i];
                perimeter += mults[j][i];
            }
            weightedtmp /= perimeter;
            newtemps[j] = temps[j] + (weightedtmp - temps[j] ) * affect_rate;
        }
        printf("sent %d temps to process: 0\n",chunk);
        MPI_Send(&offset, 1, MPI_INT, 0, tag1, MPI_COMM_WORLD);
        MPI_Send(&temps[offset], chunk, MPI_FLOAT, 0, tag2, MPI_COMM_WORLD);
        MPI_Send(&newtemps[offset], chunk, MPI_FLOAT, 0, tag3, MPI_COMM_WORLD);
    }

    MPI_Finalize();

然而,我的程序成功地通过了 while 循环的第一次迭代并找到了 while 循环的最大值(与我的串行版本匹配),然后将 temps、newtemps 和 offset 变量发送到每个进程。在这里,尽管我的程序停止并且进程从未打印出他们收到了消息。控制台如下所示:

[radeymichael@owens-login04 ~]$ mpicc -o ci changeInput.c
[radeymichael@owens-login04 ~]$ mpirun -np 3 ./ci .1 .1
sent 101 temps to process: 1
sent 100 temps to process: 2
received 101 temps from process: 1
status: 1
received 101 temps from process: 0
status: 1
sent 101 temps to process: 0
received 100 temps from process: 0
status: 1
sent 100 temps to process: 0
received 100 temps from process: 2
status: 1
max: 900.000000
sent 101 temps to process: 1
sent 100 temps to process: 2

我花了很多时间试图找出错误,但认为我缺乏使用 MPI 的基础知识。如果有人能帮我找出我的误解在哪里,我将不胜感激。

【问题讨论】:

  • 你有一个 while(stop != 1) 循环在排名零但没有在其他排名。
  • 我有这样的结构,因为我希望主进程检查是否达到收敛,以及是否没有向其他每个进程发送等量的工作,然后再次检查。也许这是我的根本误解,为什么会导致错误?
  • 错误是master之间的不匹配,它将发送几件工作到给定的等级,给定的等级将只接收一件工作。一个典型的解决方法是MPI_Bcast(&amp;stop, ...),这样所有的队伍都知道他们是否还有更多的工作要做或者他们已经完成了。
  • @GillesGouaillardet 我想我明白了。因此,如果我将 MPI_Bcast 语句放在 while 循环的末尾并为所有其他进程添加一个 while(stop != 1) 条件,那么其他进程将停止,因为 stop 现在是 1?我是否需要包含任何发送或接收才能完成这项工作?
  • MPI_Bcast() 是一个集体操作,因此必须由通信器的所有任务调用。他们都应该使用root=0,因为条件是根据这个等级评估(并且应该从这个等级传播)。

标签: c mpi


【解决方案1】:

问题是,等级 0 在 while 循环内,并将发送数据直到 stop=1,而所有其他进程将在 else 部分中的最后一个 MPI_Send 之后到达 MPI_Finalize。一种解决方案(如@Gilles 的评论中所见)是基于stop 为所有其他等级添加一个while 循环,并通过root 向所有进程广播stop .

    MPI_Bcast(&stop,1, MPI_INT, 0, MPI_COMM_WORLD);

请看下面的代码。

int nproc, rank,chunksize,leftover,offset,source, tag1=3,tag2=2,tag3=1;

MPI_Status status;
MPI_Init(&argc,&argv);
MPI_Comm_size(MPI_COMM_WORLD,&nproc);
MPI_Comm_rank(MPI_COMM_WORLD,&rank);
chunksize = (boxes / (nproc-1));
leftover = (boxes % (nproc-1));

int stop = 0;

if(rank == 0){

    //init dsv
    for(int idx = 0; idx < boxes; idx++){
        temps[idx] = newtemps[idx];
    }

    int iter = 0;
    float max_tmp;
    float min_tmp;

    while(stop != 1){
        offset = 0;
        for (int dest=1; dest<nproc; dest++) {
            int chunk = (dest <= leftover ? chunksize + 1 : chunksize);
            MPI_Send(&offset, 1, MPI_INT, dest, tag1, MPI_COMM_WORLD);
            MPI_Send(&temps[offset], chunk, MPI_FLOAT, dest, tag2, MPI_COMM_WORLD);
            MPI_Send(&newtemps[offset], chunk, MPI_FLOAT, dest, tag3, MPI_COMM_WORLD);
            printf("sent %d temps to process: %d\n",chunk, dest);
            offset = offset + chunk;
        }
        for (int dest=1; dest<nproc; dest++) {
            int chunk = (dest <= leftover ? chunksize + 1 : chunksize);
            MPI_Recv(&offset, 1, MPI_INT, dest, tag1, MPI_COMM_WORLD, &status);
            MPI_Recv(&temps[offset], chunk, MPI_FLOAT, dest, tag2, MPI_COMM_WORLD,&status);
            MPI_Recv(&newtemps[offset], chunk, MPI_FLOAT, dest, tag3, MPI_COMM_WORLD,&status);
            printf("received %d temps from process: %d\n",chunk, dest);
            printf("status: %d\n",status.MPI_TAG);

        }

        max_tmp = -10000;
        min_tmp =  10000;
        for(idx = 0; idx < boxes; idx++){
            temps[idx] = newtemps[idx];
            if(newtemps[idx] > max_tmp){
                max_tmp = newtemps[idx];
            }
            if(newtemps[idx] < min_tmp){
                min_tmp = newtemps[idx];
            }
        }
        stop = (max_tmp - min_tmp) <= (max_tmp * epsilon);
        iter += 1;
        MPI_Bcast(&stop,1, MPI_INT, 0, MPI_COMM_WORLD);

    }
}
if (rank > 0){
    while(stop != 1){
    int chunk = (rank <= leftover ? chunksize + 1 : chunksize);
    MPI_Recv(&offset, 1, MPI_INT, 0, tag1, MPI_COMM_WORLD, &status);
    MPI_Recv(&temps[offset], chunk, MPI_FLOAT, 0, tag2, MPI_COMM_WORLD,&status);
    MPI_Recv(&newtemps[offset], chunk, MPI_FLOAT, 0, tag3, MPI_COMM_WORLD,&status);
    printf("received %d temps from process: 0\n",chunk);
    printf("status: %d\n",status.MPI_TAG);

    for(int j = offset; j < offset+chunk; j++){
        float weightedtmp = 0;
        int perimeter = 0;
        int num_iters = neighbors[j][0];
        for(int i = 1; i <= num_iters; i++){
            weightedtmp += temps[neighbors[j][i]] * mults[j][i];
            perimeter += mults[j][i];
        }
        weightedtmp /= perimeter;
        newtemps[j] = temps[j] + (weightedtmp - temps[j] ) * affect_rate;
    }
    printf("sent %d temps to process: 0\n",chunk);
    MPI_Send(&offset, 1, MPI_INT, 0, tag1, MPI_COMM_WORLD);
    MPI_Send(&temps[offset], chunk, MPI_FLOAT, 0, tag2, MPI_COMM_WORLD);
    MPI_Send(&newtemps[offset], chunk, MPI_FLOAT, 0, tag3, MPI_COMM_WORLD);
    MPI_Bcast(&stop,1, MPI_INT, 0, MPI_COMM_WORLD);
 }

}

MPI_Finalize();

【讨论】:

    猜你喜欢
    • 1970-01-01
    • 1970-01-01
    • 2015-08-16
    • 1970-01-01
    • 1970-01-01
    • 1970-01-01
    • 2016-11-03
    • 2019-01-07
    • 1970-01-01
    相关资源
    最近更新 更多