2 * Program to test the fairness of the MPI implementation over source.
3 * All of the programs wait on a barrier, then node 0 starts receiving
4 * small messages using ANY_SOURCE from all of the other nodes who
5 * send as much as they can. Node 0 collects statistics on the rate
6 * messages are received from each source. (Every N messages it
7 * prints out what percentage of the last N received were from each
8 * source. It does this for <size-1> times.
10 * This program should be run with at least 8 nodes just to be (un)fair
12 * Patrick Bridges * bridges@mcs.anl.gov * patrick@CS.MsState.Edu
25 int rank, size, an_int[MSZ];
27 char *Current_Test = NULL;
31 /* Initialize the environment */
32 mp_environ(&size,&rank);
34 /* Get allgrp from the task */
36 mp_task_query(dummy,&d1,&d2);
40 Test_Init("fairness", rank);
42 /* Wait for everyone to be ready */
44 /* Initialize an array to keep statistics in */
45 num_array = (int *)malloc((size - 1) * sizeof(int));
49 for (i = 0; i < size - 1; i++) {
50 /* Clear the buffer of counts */
51 memset(num_array, 0, (size - 1) * sizeof(int));
52 for (j = 0; j < MPG; j++) {
55 mp_brecv(an_int, &d1, &dontcare, &d2);
58 Test_Printf("Statistics for message group %d:\n", i + 1);
59 for (j = 0; j < size -1 ; j++)
60 Test_Printf("%f%% of last %d messages received \
61 were from source %d.\n",
62 num_array[j]*100.0/MPG, MPG, j + 1);
65 (void)Summarize_Test_Results();
68 for (i = 0; i < MPG; i++) {
75 mp_bend(an_int, &d1, &d2, &d3, &d4);