⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 contigstruct.c

📁 mpi并行计算的c++代码 可用vc或gcc编译通过 可以用来搭建并行计算试验环境
💻 C
字号:
/* -*- Mode: C; c-basic-offset:4 ; -*- *//* * *  (C) 2003 by Argonne National Laboratory. *      See COPYRIGHT in top-level directory. */#include "mpi.h"#include <stdio.h>/* * This test checks to see if we can create a simple datatype * made from many contiguous copies of a single struct.  The * struct is built with monotone decreasing displacements to * avoid any struct->contig optimizations. */int main( int argc, char **argv ){    int           blocklens[8], psize, i, rank;    MPI_Aint      displs[8];    MPI_Datatype  oldtypes[8];    MPI_Datatype  ntype1, ntype2;    MPI_Init( &argc, &argv );    MPI_Comm_rank( MPI_COMM_WORLD, &rank );        for (i=0; i<8; i++) {	blocklens[i] = 1;	displs[i]    = (7-i) * sizeof(long);	oldtypes[i]  = MPI_LONG;    }    MPI_Type_struct( 8, blocklens, displs, oldtypes, &ntype1 );    MPI_Type_contiguous( 65536, ntype1, &ntype2 );    MPI_Type_commit( &ntype2 );    MPI_Pack_size( 2, ntype2, MPI_COMM_WORLD, &psize );    MPI_Type_free( &ntype2 );	MPI_Type_free( &ntype1 );    /* The only failure mode has been SEGV or aborts within the datatype       routines */    if (rank == 0) {	printf( " No Errors\n" );    }    MPI_Finalize();    return 0;}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -