-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathgameoflife.c
More file actions
113 lines (93 loc) · 2.44 KB
/
Copy pathgameoflife.c
File metadata and controls
113 lines (93 loc) · 2.44 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
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <assert.h>
#ifdef _OPENMP
#include <omp.h>
#endif
#define N 2048
#define SRAND_VALUE 1985
#define GENERATIONS 2000
#define MAX_THREADS 4
int getLine(int i, int neighbor_p){
i+=neighbor_p;
if(i<0)
return i+N;
if(i>=N)
return i-N;
return i;
}
int getCol(int j, int neighbor_p){
j+=neighbor_p;
if(j<0)
return j+N;
if(j>=N)
return j-N;
return j;
}
int getNeighbors(int** grid, int i, int j){
int neighbors = 0;
for(int k = -1; k<=1; k++)
for(int l=-1; l<=1; l++)
if(k||l)
if(grid[getLine(i,k)][getCol(j,l)])
neighbors++;
return neighbors;
}
int **grid, **newgrid, r;
long int result =0;
int main(){
int i, j;
grid = (int**)malloc(N*sizeof(int*));
newgrid = (int**)malloc(N*sizeof(int*));
for(int i = 0; i<N; i++){
grid[i] = (int*)malloc(N*sizeof(int));
newgrid[i] = (int*)malloc(N*sizeof(int));
}
srand(SRAND_VALUE);
for(i = 0; i<N; i++) { //laço sobre as células do tabuleiro sem contar com um eventual halo
for(j = 0; j<N; j++) {
grid[i][j] = rand() % 2;
}
}
//tempo inicial
double start = omp_get_wtime();
int neighbors;
for(i=0; i<GENERATIONS; i++){
result = 0;
#pragma omp parallel num_threads(MAX_THREADS) reduction(+:result)
{
#pragma omp for private(i,j, neighbors)
for(i = 0; i<N; i++){
for(j = 0; j<N; j++){
neighbors = getNeighbors(grid, i, j);
if(neighbors < 2 || neighbors > 3)//a célula morre por abandono ou por superpopulação
newgrid[i][j] = 0;
else if(neighbors == 2) //mantém o estado da célula
newgrid[i][j] = grid[i][j];
else if(neighbors == 3) //a célula vive
newgrid[i][j] = 1;
}
}
#pragma omp for private (i,j)
for(i = 0; i<N; i++)
for(j = 0; j<N; j++){
grid[i][j] = newgrid[i][j];
}
}
}
//tempo final
double end = omp_get_wtime();
#pragma omp parallel
#pragma omp for private (i,j) reduction(+:result)
for(i = 0; i<N; i++){
for(j = 0; j<N; j++){
if(newgrid[i][j]) result++;
}
}
printf("A quantidade de celulas vivas na %d geração é: %ld\n",GENERATIONS, result);
printf("tempo de execução: %f segundos\n", end-start);
free(grid);
free(newgrid);
return 0;
}