File: test1.116.prog.c

package info (click to toggle)
slurm-wlm 22.05.8-4%2Bdeb12u3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 48,492 kB
  • sloc: ansic: 475,246; exp: 69,020; sh: 8,862; javascript: 6,528; python: 6,444; makefile: 4,185; perl: 4,069; pascal: 131
file content (65 lines) | stat: -rw-r--r-- 2,165 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
/*****************************************************************************\
 *  test1.116.prog.c - Extended ping test of operation with Slurm.
 *****************************************************************************
 *  Copyright (C) 2019  SchedMD LLC.
 *
 *  This file is part of Slurm, a resource management program.
 *  For details, see <https://slurm.schedmd.com/>.
 *  Please also read the included file: DISCLAIMER.
 *
 *  Slurm is free software; you can redistribute it and/or modify it under
 *  the terms of the GNU General Public License as published by the Free
 *  Software Foundation; either version 2 of the License, or (at your option)
 *  any later version.
 *
 *  Slurm is distributed in the hope that it will be useful, but WITHOUT ANY
 *  WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
 *  FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more
 *  details.
 *
 *  You should have received a copy of the GNU General Public License along
 *  with Slurm; if not, write to the Free Software Foundation, Inc.,
 *  51 Franklin Street, Fifth Floor, Boston, MA 02110-1301  USA.
\*****************************************************************************/

#include <mpi.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <unistd.h>
#include <sys/utsname.h>

#define _DEBUG 0
#define ARRAY_LEN 4

int main(int argc, char * argv[])
{
	int i;
	int size, rank;
	int local_sum = 0, global_sum = 0;
	int array[ARRAY_LEN];

	MPI_Init(&argc, &argv);
	MPI_Comm_size(MPI_COMM_WORLD, &size);
	MPI_Comm_rank(MPI_COMM_WORLD, &rank);

	if (rank == 0) {
		for (i = 0; i < ARRAY_LEN; i++)
			array[i] = rank + i;
	}
	MPI_Bcast(array, ARRAY_LEN, MPI_INT, 0, MPI_COMM_WORLD);
	for (i = 0; i < ARRAY_LEN; i++)
		local_sum += array[i];
#if _DEBUG
	for (i = 0; i < ARRAY_LEN; i++)
		printf("Rank[%d] Array[%d]=%d\n", rank, i, array[i]);
	printf("Rank[%d] LocalSum=%d\n", rank, local_sum);
#endif
	MPI_Reduce(&local_sum, &global_sum, 1, MPI_INT, MPI_SUM, 0,
		   MPI_COMM_WORLD);
	if (rank == 0)
		printf("Rank[%d] GlobalSum=%d\n", rank, global_sum);
	MPI_Finalize();
	return 0;
}