source: CIVL/examples/mpi/sum_array.c@ fbb1e35

#ifdef _CIVL
#include <civlc.cvh>
#endif
/* sum_array.c : parallel adder for an array of 
 * floating-point numbers.
 * To execute: mpicc sum_array.c ; mpiexec -n 4 ./a.out
 * Or replace "4" with however many procs you want to use.
 * To verify: civl verify sum_array.c
 */ 
#include <stdio.h>
#include <mpi.h>

/* MPI message passing tags */
#define MSG_DATA 100
#define MSG_RESULT 101
#ifdef _CIVL
$input int _NPROCS_LOWER_BOUND = 2;
$input int _NPROCS_UPPER_BOUND = 5;
$input long NB = 20;               // upper bound of N
$input long N;                     // length of the array
$assume(0 < N && N <= NB);
double oracle;
#else
#define N 100000
#endif
 
void master (void);
void slave (void);
 
int main (int argc, char **argv) {
  int myrank;

  MPI_Init (&argc, &argv);
  MPI_Comm_rank (MPI_COMM_WORLD, &myrank);
  if (!myrank)
    master ();
  else
    slave ();
  MPI_Finalize ();
  return 0;
}
 
void master (void) {
  float array[N];
  double mysum, tmpsum;
  unsigned long long step, i;
  int size;
  MPI_Status status;

  //Initialization of the array
  for (i = 0; i < N; i++)
    array[i] = i + 1;
#ifdef _CIVL
  oracle = 0.0;
  for(i = 0; i < N; i++)
    oracle += array[i];
#endif
  MPI_Comm_size (MPI_COMM_WORLD, &size);
  if (size != 1)
    step = N / (size - 1);
  //The array is divided by the number of slaves
  for (i = 0; i < size - 1; i++)
    MPI_Send (array + i * step, step, MPI_FLOAT, i + 1, MSG_DATA, MPI_COMM_WORLD);
  //The master completes the work if necessary
  for (i = (size - 1) * step, mysum = 0; i < N; i++)
    mysum += array[i];
  //The master receives the results in any order
  for (i = 1; i < size; mysum += tmpsum, i++)
    MPI_Recv (&tmpsum, 1, MPI_DOUBLE, MPI_ANY_SOURCE, MSG_RESULT, MPI_COMM_WORLD, &status);
#ifdef _CIVL
  $assert(oracle == mysum, "The sum of %d array elements "
    "is %f but the expected one is %f.\n", N, mysum, oracle);
#endif
  printf ("%lf\n", mysum);
}

void slave (void) {
  float array[N];
  double sum;
  unsigned long long i;
  int count;
  MPI_Status status;
  MPI_Recv (array, N, MPI_FLOAT, 0, MSG_DATA, MPI_COMM_WORLD, &status);
  //The slave finds the size of the array
  MPI_Get_count (&status, MPI_FLOAT, &count);
  for (i = 0, sum = 0; i < count; i++)
    sum += array[i];
  MPI_Send (&sum, 1, MPI_DOUBLE, 0, MSG_RESULT, MPI_COMM_WORLD);
}