int main(int argc, char **argv)
{
- int size, rank;
- int value = 3;
+ int i, size, rank;
+ int count = 2048;
+ int *values;
int status;
MPI_Init(&argc, &argv);
MPI_Comm_size(MPI_COMM_WORLD, &size);
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
+
+ values = (int *) xbt_malloc(count * sizeof(int));
- if (0 == rank) {
- value = 17;
- }
- status = MPI_Bcast(&value, 1, MPI_INT, 0, MPI_COMM_WORLD);
- printf("node %d has value %d after broadcast\n", rank, value);
+ for (i = 0; i < count; i++)
+ values[i] = (0 == rank) ? 17 : 3;
+
+ status = MPI_Bcast(values, count, MPI_INT, 0, MPI_COMM_WORLD);
+
+ int good = 0;
+ for (i = 0; i < count; i++)
+ if (values[i]==17) good++;
+ printf("[%d] number of values equals to 17: %d\n", rank, good);
MPI_Barrier(MPI_COMM_WORLD);
+ xbt_free(values);
+
+ count = 4096;
+ values = (int *) xbt_malloc(count * sizeof(int));
+
+ for (i = 0; i < count; i++)
+ values[i] = (size -1 == rank) ? 17 : 3;
+ status = MPI_Bcast(values, count, MPI_INT, size-1, MPI_COMM_WORLD);
+
+ good = 0;
+ for (i = 0; i < count; i++)
+ if (values[i]==17) good++;
+ printf("[%d] number of values equals to 17: %d\n", rank, good);
+
+
+
+
if (rank == 0) {
if (status != MPI_SUCCESS) {
printf("bcast returned %d\n", status);
fflush(stdout);
}
}
-
+ xbt_free(values);
MPI_Finalize();
return 0;
}
