-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathforestParallel.c
More file actions
202 lines (195 loc) · 4.36 KB
/
forestParallel.c
File metadata and controls
202 lines (195 loc) · 4.36 KB
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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
// MPI Demo
// mpicc mpiDemo.c
// mpirun -np 4 a.out
//
// Manager-Worker model for parallel processing.
//
// time ... real ... user
//
// htop
#include <stdio.h>
#include <stdlib.h>
//
#include <time.h>
#include "mpi.h"
//
void display(char forest[30][30], int gridSize)
{
printf("\033[2J\033[1;1H");
int i, j;
for (i = 0; i < gridSize; i++)
{
for (j = 0; j < gridSize; j++)
{
if (forest[i][j] == 'T')
printf("\x1b[32m%c\x1b[0m ", forest[i][j]);
else if (forest[i][j] == '-')
printf("\x1b[33m%c\x1b[0m ", forest[i][j]);
else
printf("\x1b[31m%c\x1b[0m ", forest[i][j]);
}
printf("\n");
}
}
int hasFire(char forest[30][30], int gridSize)
{
int i, j;
for (i = 0; i < gridSize; i++)
{
for (j = 0; j < gridSize; j++)
{
if (forest[i][j] == 'X')
return 1;
}
}
return 0;
}
//
int main( int argc , char* argv[] )
{
int rank ;
int size ;
MPI_Status status ;
int tag = 0;
//
// other variables
//
int kmpi , jmpi ;
//
// boilerplate
//
MPI_Init( &argc , &argv ) ;
MPI_Comm_size( MPI_COMM_WORLD , &size ) ; // same
MPI_Comm_rank( MPI_COMM_WORLD , &rank ) ; // different
//
// manager has rank = 0
//
clock_t begin, end;
srand(time(NULL));
double probability = 0.0, ret, loopProbabilities[100], tempProb[size];
int i, j, count, k, trials = 1000, assign, gridSize = 30;
char forest[gridSize][gridSize];
FILE* out = fopen("forestFireData.txt", "w");
FILE* outTime = fopen("runTimeData.txt", "w");
begin = clock();
if (rank == 0)
{
for (assign = 1; assign < size; assign++)
{
MPI_Send( &probability , 1 , MPI_DOUBLE , assign , tag , MPI_COMM_WORLD ) ;
probability += .01;
tempProb[assign] = probability;
}
while (probability < 1.0)
{
MPI_Recv( &ret , 1 , MPI_DOUBLE , MPI_ANY_SOURCE , tag , MPI_COMM_WORLD , &status ) ;
assign = status.MPI_SOURCE ;
loopProbabilities[(int)(100*tempProb[assign])] = ret;
MPI_Send( &probability , 1 , MPI_DOUBLE , assign , tag , MPI_COMM_WORLD ) ;
tempProb[assign] = probability;
probability += .01;
}
probability = -1.0;
for (jmpi = 1; jmpi < size; jmpi++)
{
MPI_Recv( &ret , 1 , MPI_DOUBLE , MPI_ANY_SOURCE , tag , MPI_COMM_WORLD , &status ) ;
assign = status.MPI_SOURCE;
loopProbabilities[(int)(100*tempProb[assign])] = ret;
MPI_Send( &probability , 1 , MPI_DOUBLE , assign , tag , MPI_COMM_WORLD ) ;
}
for (assign = 0; assign < 100; assign++)
{
fprintf(out, "%f\n", loopProbabilities[assign]);
}
}
else
{
while (1)
{
MPI_Recv( &probability , 1 , MPI_DOUBLE , 0 , tag , MPI_COMM_WORLD , &status ) ;
if (probability < 0.0) break;
count = 0;
for (k = 0; k < trials; k++)
{
for (i = 0; i < gridSize; i++)
{
for (j = 0; j < gridSize; j++)
{
if (rand()/(float)(RAND_MAX) < probability)
{
forest[i][j] = 'T';
}
else
{
forest[i][j] = '-';
}
}
}
for (i = 0; i < gridSize; i++)
{
forest[i][0] = 'X';
}
//display(forest, gridSize);
while (hasFire(forest, gridSize))
{
for (i = 0; i < gridSize; i++)
{
for (j = 0; j < gridSize; j++)
{
if (forest[i][j] == 'X')
{
forest[i][j] = '-';
if (j > 0 && forest[i][j-1] == 'T')
{
forest[i][j-1] = 'x';
}
if (j < gridSize-1 && forest[i][j+1] == 'T')
{
forest[i][j+1] = 'x';
}
if (i > 0 && forest[i-1][j] == 'T')
{
forest[i-1][j] = 'x';
}
if (i < gridSize-1 && forest[i+1][j] == 'T')
{
forest[i+1][j] = 'x';
}
}
}
}
for (i = 0; i < gridSize; i++)
{
for (j = 0; j < gridSize; j++)
{
if (forest[i][j] == 'x')
forest[i][j] = 'X';
}
}
//display(forest, gridSize);
//usleep(80000);
count = count + 1;
}
}
ret = count/(trials*(float)gridSize);
MPI_Send( &ret , 1 , MPI_DOUBLE , 0 , tag , MPI_COMM_WORLD ) ;
}
}
MPI_Finalize() ;
//
fclose(out);
end = clock();
//fprintf(outTime, "%f\n", (double)(end-begin)/ CLOCKS_PER_SEC);
printf("%f\n", (double)(end-begin)/ CLOCKS_PER_SEC);
fclose(outTime);
return 0;
}
//
// end of file
//
// time ./a.out
// Time: 0.3139879703521729 seconds
//
// real 0m0.315s
// user 0m0.313s
// sys 0m0.001s