我正在尝试理解MPI_Type_contiguous的工作原理,我已经为它写了一段代码
#include "mpi.h"
#include <stdio.h>
int main(int argc, char *argv[])
{
int myrank;
MPI_Status status;
MPI_Datatype type;
int buffer[100];
if(myrank==0)
{
for(int i=0;i<100;i++)
{
buffer[i]=i;
}
}
MPI_Init(&argc, &argv);
MPI_Type_contiguous( 100, MPI_CHAR, &type );
MPI_Type_commit(&type);
MPI_Comm_rank(MPI_COMM_WORLD, &myrank);
if (myrank == 0)
{
MPI_Send(buffer, 1, type, 1, 123, MPI_COMM_WORLD);
}
else if (myrank == 1)
{
MPI_Recv(buffer, 1, type, 0, 123, MPI_COMM_WORLD, &status);
}
if(myrank==1)
{
for(int i=0;i<100;i++)
{
printf("%d ",buffer[i]);
}
}
MPI_Finalize();
return 0;
}但是它给了我这个错误
===================================================================================
= BAD TERMINATION OF ONE OF YOUR APPLICATION PROCESSES
= PID 11963 RUNNING AT csews20
= EXIT CODE: 139
= CLEANING UP REMAINING PROCESSES
= YOU CAN IGNORE THE BELOW CLEANUP MESSAGES
===================================================================================
YOUR APPLICATION TERMINATED WITH THE EXIT STRING: Segmentation fault (signal 11)
This typically refers to a problem with your application.
Please see the FAQ page for debugging suggestions我不能理解这个错误的原因,因为我无法在我的代码中找出分段错误的原因。
发布于 2021-02-17 21:03:18
查看您的代码,我注意到数组的类型是int,而不是char,所以您应该使用MPI_INT而不是MPI_CHAR。此外,您需要首先初始化rank。只需这样做:
MPI_Init(&argc, &argv);
MPI_Comm_rank(MPI_COMM_WORLD, &myrank);然后使用排名。
#include "mpi.h"
#include <stdio.h>
int main(int argc, char *argv[])
{
int myrank;
MPI_Init(&argc, &argv);
MPI_Comm_rank(MPI_COMM_WORLD, &myrank);
MPI_Status status;
MPI_Datatype type;
int buffer[100];
for(int i=0;i<100;i++)
{
buffer[i]=i;
}
MPI_Type_contiguous( 100, MPI_CHAR, &type );
MPI_Type_commit(&type);
if (myrank == 0)
{
MPI_Send(buffer, 1, type, 1, 123, MPI_COMM_WORLD);
}
else if (myrank == 1)
{
MPI_Recv(buffer, 1, type, 0, 123, MPI_COMM_WORLD, &status);
}
if(myrank==1)
{
for(int i=0;i<100;i++)
{
printf("%d ",buffer[i]);
}
}
MPI_Finalize();
return 0;
}我还推荐阅读下面的SO Thread MPI_Type_contiguous vs primitive types。
https://stackoverflow.com/questions/66241590
复制相似问题