-
Notifications
You must be signed in to change notification settings - Fork 0
/
prime_number_checker.cpp
102 lines (83 loc) · 2.03 KB
/
prime_number_checker.cpp
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
#include<stdio.h>
#include<mpi.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<iostream>
using namespace std;
int main(int argc, char *argv[])
{
int rank, size, number = atoi(argv[1]);
if(MPI_Init(&argc, &argv) != MPI_SUCCESS)
{
fprintf(stderr, "Unable to initialize MPI!\n");
return -1;
}
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
MPI_Comm_size(MPI_COMM_WORLD, &size);
int ARRAY_SIZE;
ARRAY_SIZE = number - 2;
MPI_Status status;
int ARRAY_CHUNK_SIZE = ARRAY_SIZE/size;
int total_sum = 0;
int * array = (int *) malloc(sizeof(int) * ARRAY_SIZE);
int * chunk = (int *) malloc(sizeof(int) * ARRAY_CHUNK_SIZE);
int i;
for(i = 0; i < ARRAY_SIZE; i++)
{
array[i] = i + 2;
}
MPI_Scatter(array,
ARRAY_CHUNK_SIZE,
MPI_INT,
chunk,
ARRAY_CHUNK_SIZE,
MPI_INT,
0,
MPI_COMM_WORLD);
int key = 1, temp = 0, primeflag = 1, sum = 0;
for(i = 0; i < ARRAY_CHUNK_SIZE; i++)
{
int remainder = number % chunk[i];
if(remainder == 0) primeflag = remainder;
}
bool rank_zero = false;
bool prime_one = false;
if(rank == 0) rank_zero = true;
if(prime_one == 1) prime_one = true;
if(!rank_zero) MPI_Send(
&primeflag,
1,
MPI_INT,
0,
0,
MPI_COMM_WORLD);
else if(rank_zero && prime_one)
{
for(key = 1; key < size; key++)
{
int ifprime;
ifprime = 1;
MPI_Recv(
&ifprime,
1,
MPI_INT,
key,
0,
MPI_COMM_WORLD,
&status);
if(ifprime == 0)
{
primeflag = 0;
break;
}
}
}
if(rank_zero)
if(primeflag==0) printf("%d is not a prime\n",number);
else printf("%d is a prime\n",number);
free(array);
free(chunk);
MPI_Finalize();
return 0;
}