簡體   English   中英

通過自定義通信器發送數組

[英]Send an array over a custom communicator

1. 目標

我必須通過自定義通信器(不是MPI_COMM_WORLD )分發一個名為A_loc的數組。 假設我們想在mesh_r通信器上分配一個數組:

P0-P1
|  |  
P2-P3

其中-表示mesh_r (mesh_rows) 通信器和| 表示mesh_c (mesh_columns) 通信器,通過build_mesh程序構建。

2.代碼

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <mpi.h>

bool is_divisible(int, int);
void build_mesh(MPI_Comm*, MPI_Comm*, MPI_Comm*, int, int, int, int, int*);
int *fill_matrix(int*, int, int);
void print_matrix(int*, int, int, int, int);
void handle_errors(int, int, int, int);
void distribute(int*, int*, int, int, int, int, int, int, int);
void debug(int*, int*, int, int, int, int, int, int, int);

int main(int argc, char *argv[])
{
    int process_rank, world_size;
    int mesh_rows, mesh_columns;
    int mesh_dimension = 2;
    int *process_coordinates;
    MPI_Comm mesh, mesh_r, mesh_c;
    int process_rank_mesh;
    int *A, *A_loc;
    int *B, *B_loc;
    int m, n, mloc, nloc;

    MPI_Init(&argc, &argv);
    MPI_Comm_rank(MPI_COMM_WORLD, &process_rank);
    MPI_Comm_size(MPI_COMM_WORLD, &world_size);

    if (process_rank == 0) {
        m = n = world_size * 1; // multiple of world_size = 4
    }

    MPI_Bcast(&m, 1, MPI_INT, 0, MPI_COMM_WORLD);
    MPI_Bcast(&n, 1, MPI_INT, 0, MPI_COMM_WORLD);
    A = fill_matrix(A, m, n);
    B = fill_matrix(A, m, n);

    if (process_rank == 0) 
        mesh_rows = 2;

    if (is_divisible(world_size, mesh_rows))
        mesh_columns = world_size / mesh_rows;
    else {
        mesh_rows = 1;
        mesh_columns = world_size / mesh_rows;
    }
   
    MPI_Bcast(&mesh_rows, 1, MPI_INT, 0, MPI_COMM_WORLD);
    MPI_Bcast(&mesh_columns, 1, MPI_INT, 0, MPI_COMM_WORLD);

    process_coordinates = (int*) calloc(mesh_dimension, sizeof(int));
    build_mesh(&mesh, &mesh_r, &mesh_c, process_rank, world_size, mesh_rows, mesh_columns, process_coordinates);
    MPI_Comm_rank(mesh, &process_rank_mesh); 
 
    mloc = m / mesh_rows;
    nloc = m / mesh_columns;

    handle_errors(m, n, world_size, process_rank);

    A_loc = (int*) calloc(mloc * nloc, sizeof(int));
    distribute(A, A_loc, m, n, mloc, nloc, world_size, mesh_rows, mesh_columns);
    
    B_loc = (int*) calloc(mloc * nloc, sizeof(int));
    distribute(B, B_loc, m, n, mloc, nloc, world_size, mesh_rows, mesh_columns);

    // I want to re-write this part so I can exploit mesh_r communicator instead of MPI_COMM_WORLD...
    int *A_loc_add = (int*) calloc(mloc * nloc, sizeof(int));
    if (process_rank == 0) {
        MPI_Send(A_loc, mloc * nloc, MPI_INT, 1, 10, MPI_COMM_WORLD);
    } else if (process_rank == 3) {
        MPI_Send(A_loc, mloc * nloc, MPI_INT, 2, 20, MPI_COMM_WORLD);
    }
    MPI_Status status;
    if (process_rank == 1) {
        MPI_Recv(A_loc_add, mloc * nloc, MPI_INT, 0, 10, MPI_COMM_WORLD, &status);
    } else if (process_rank == 2) {
        MPI_Recv(A_loc_add, mloc * nloc, MPI_INT, 3, 20, MPI_COMM_WORLD, &status);
    }

    MPI_Finalize();
    return 0;
}


void distribute(int *Mat, int *Mat_loc, int m, int n, int mloc, int nloc, int world_size, int mesh_rows, int mesh_columns)
{
    MPI_Datatype square_block;
    int stride = n;
    int count = mloc;
    int block_length = nloc;
    MPI_Type_vector(count, block_length, stride, MPI_INT, &square_block);
    MPI_Datatype square_block_resized;
    MPI_Type_create_resized(square_block, 0, sizeof(int), &square_block_resized);
    MPI_Type_commit(&square_block_resized);
    int *send_counts = (int*) calloc(world_size, sizeof(int));
    int *displs = (int*) calloc(world_size, sizeof(int));
    for (int i = 0; i < mesh_rows; i++) {
        for (int j = 0; j < mesh_columns; j++) {
            send_counts[i * mesh_columns + j] = 1;
            displs[i * mesh_columns + j] = i * n * block_length + j * block_length;
        }
    }
    
    MPI_Scatterv(Mat, send_counts, displs, square_block_resized, Mat_loc, mloc * nloc, MPI_INT, 0, MPI_COMM_WORLD);
}


bool is_divisible(int dividend, int divisor)
{
    return dividend % divisor == 0;
}

void build_mesh(MPI_Comm *mesh, MPI_Comm *mesh_r, MPI_Comm *mesh_c, int process_rank, int world_size,
    int mesh_rows, int mesh_columns, int *process_coordinates) 
{
    int mesh_dimension = 2;
    int *mesh_n_dimension;
    int mesh_reorder = 0;
    int *mesh_period;
    int *remain_dims = (int*) calloc(mesh_dimension, sizeof(int));
    mesh_n_dimension = (int*) calloc(mesh_dimension, sizeof(int));
    mesh_n_dimension[0] = mesh_rows;
    mesh_n_dimension[1] = mesh_columns;
    mesh_period = (int*) calloc(mesh_dimension, sizeof(int));
    mesh_period[0] = mesh_period[1] = 0;
    MPI_Cart_create(MPI_COMM_WORLD, mesh_dimension, mesh_n_dimension, mesh_period, mesh_reorder, mesh);
    MPI_Cart_coords(*mesh, process_rank, mesh_dimension, process_coordinates);
    remain_dims[0] = 0;  
    remain_dims[1] = 1;
    MPI_Cart_sub(*mesh, remain_dims, mesh_r);
    remain_dims[0] = 1;
    remain_dims[1] = 0;
    MPI_Cart_sub(*mesh, remain_dims, mesh_c);
}

int *fill_matrix(int *Mat, int m, int n)
{
    int k = 0;
    Mat = (int*) calloc(m * n, sizeof(int));
    for (int i = 0; i < m; i++)
        for (int j = 0; j < n; j++) 
            Mat[i * n + j] = ++k;
    return Mat;
}

如您所見,這工作正常,但我希望我可以重寫該注釋部分,以便我可以利用mesh_r通信器並將 A_loc 分配A_loc上的每個處理器,而不是在mesh_r上使用dest = 1dest = 2 MPI_COMM_WORLD硬編碼send .

  • 有什么幫助嗎?

您應該像在早期版本的代碼中那樣使用Bcast ,而不是發送和接收。 您的問題是您沒有以分布式方式思考,而是試圖保持全局視圖。 我的意思是,在您創建子通信mesh_r ,每個進程似乎都在該通信器中,但是它來了:有多個mesh_r通信器,每個進程都是一個通信器的一部分。 每個 MPI 進程都能准確地看到它所屬的一個mesh_r通信器。 因此,單個代碼行MPI_Bcast(...buffer stuff...., mesh_r )執行多個廣播,每個網格行中一個。

暫無
暫無

聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.

 
粵ICP備18138465號  © 2020-2024 STACKOOM.COM