1 /* Copyright (c) 2013-2014. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
8 * (C) 2001 by Argonne National Laboratory.
9 * See COPYRIGHT in top-level directory.
16 /* This program tests MPI_Alltoallv by having processor i send different amounts of data to each processor.
18 TODO As there are separate send and receive types to alltoallv, there need to be tests to rearrange data on the fly.
19 The first test sends i items to processor i from all processors.
20 Currently, the test uses only MPI_INT; this is adequate for testing systems that use point-to-point operations
22 Example values for 3 processes:
23 * <0> sbuf: (#9): [0][1][2][3][4][5][6][7][8]
24 <0> scount: (#3): [0][1][2]
25 <0> rcount: (#3): [0][0][0]
26 <0> sdisp: (#3): [0][1][3]
27 <0> rdisp: (#3): [0][0][0]
29 <1> sbuf: (#9): [100][101][102][103][104][105][106][107][108]
30 <1> scount: (#3): [0][1][2]
31 <1> rcount: (#3): [1][1][1]
32 <1> sdisp: (#3): [0][1][3]
33 <1> rdisp: (#3): [0][1][2]
35 <2> sbuf: (#9): [200][201][202][203][204][205][206][207][208]
36 <2> scount: (#3): [0][1][2]
37 <2> rcount: (#3): [2][2][2]
38 <2> sdisp: (#3): [0][1][3]
39 <2> rdisp: (#3): [0][2][4]
42 <0> rbuf: (#9): [-1][-1][-1][-1][-1][-1][-1][-1][-1]
43 <1> rbuf: (#9): [1][101][201][-1][-1][-1][-1][-1][-1]
44 <2> rbuf: (#9): [3][4][103][104][203][204][-1][-1][-1]
47 static void print_buffer_int(void *buf, int len, char *msg, int rank)
50 printf("[%d] %s (#%d): ", rank, msg, len);
51 for (tmp = 0; tmp < len; tmp++) {
53 printf("[%d]", v[tmp]);
59 int main(int argc, char **argv)
64 int *sendcounts, *recvcounts, *rdispls, *sdispls;
66 MPI_Init(&argc, &argv);
68 comm = MPI_COMM_WORLD;
70 /* Create the buffer */
71 MPI_Comm_size(comm, &size);
72 MPI_Comm_rank(comm, &rank);
73 sbuf = (int *) xbt_malloc(size * size * sizeof(int));
74 rbuf = (int *) xbt_malloc(size * size * sizeof(int));
76 /* Load up the buffers */
77 for (i = 0; i < size * size; i++) {
78 sbuf[i] = i + 100 * rank;
82 /* Create and load the arguments to alltoallv */
83 sendcounts = (int *) xbt_malloc(size * sizeof(int));
84 recvcounts = (int *) xbt_malloc(size * sizeof(int));
85 rdispls = (int *) xbt_malloc(size * sizeof(int));
86 sdispls = (int *) xbt_malloc(size * sizeof(int));
87 for (i = 0; i < size; i++) {
90 rdispls[i] = i * rank;
91 sdispls[i] = (i * (i + 1)) / 2;
94 print_buffer_int( sbuf, size*size, strdup("sbuf:"),rank);
95 print_buffer_int( sendcounts, size, strdup("scount:"),rank);
96 print_buffer_int( recvcounts, size, strdup("rcount:"),rank);
97 print_buffer_int( sdispls, size, strdup("sdisp:"),rank);
98 print_buffer_int( rdispls, size, strdup("rdisp:"),rank);
100 MPI_Alltoallv(sbuf, sendcounts, sdispls, MPI_INT, rbuf, recvcounts, rdispls, MPI_INT, comm);
102 print_buffer_int( rbuf, size*size, strdup("rbuf:"),rank);
104 MPI_Barrier(MPI_COMM_WORLD);
106 printf("Alltoallv TEST COMPLETE.\n");