-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathproject3.c
145 lines (114 loc) · 3.02 KB
/
project3.c
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
#include <stdlib.h>
#include <unistd.h>
#include <semaphore.h>
#include <sys/mman.h>
#include <math.h>
#include <time.h>
#define handle_error(msg)\
do{perror(msg); exit(EXIT_FAILURE);} while(0)
typedef struct task {
int i;
char* dst;
int miThnk;
int maThnk;
int miDin;
int maDin;
int numDin;
int numbPhil;
} WT;
sem_t* Quato;
sem_t* forks;
double Exp(double l)
{
double Rand = rand()/(1.0 + RAND_MAX);
int range = 100 - 1 + 1;
int scaledRand = (Rand * range) +1;
int result = scaledRand;
double a;
double mean;
a = (double) result / 101.0;
mean = -l * log(a);
return (int) mean;
}
void ThreadWork(void *i) {
struct timespec start;
struct timespec end;
double elapsed;
WT *x = ((WT *) i);
int thinkTime = 0;
int dineTime = 0;
if(x->dst == "uniform") {
double Rand = rand()/(1.0 + RAND_MAX);
int range = x->maThnk - x->miThnk + 1;
int scaledRand = (Rand * range) + x->miThnk;
thinkTime = scaledRand;
double Rand1 = rand()/(1.0 + RAND_MAX);
int range1 = x->maDin -x-> miDin + 1;
int scaledRand1 = (Rand1 * range1) +x-> miDin;
dineTime = scaledRand1;
} else {
thinkTime = Exp((double) (x->miThnk + x->maThnk) / 2);
dineTime = Exp( (double) ((x->miDin + x->maDin) / 2));
}
clock_gettime(CLOCK_MONOTONIC, &start);
while(x->numDin > 0) {
usleep(thinkTime*1000);
sem_wait(&Quato);
sem_wait(&forks[x->i]);
sem_wait(&forks[(x->i+1)%x->numbPhil]);
x->numDin--;
usleep(dineTime*1000);
sem_post(&forks[x->i]);
sem_post(&forks[(x->i+1)%x->numbPhil]);
sem_post(&Quato);
}
clock_gettime(CLOCK_MONOTONIC, &end);
elapsed = (end.tv_sec - start.tv_sec);
elapsed += (end.tv_nsec - start.tv_nsec) / 1000000000.0;
printf("philosopher #%d is done\n in %f milliseconds \n", x->i, elapsed);
free(x);
pthread_exit(NULL);
}
int main(int argc, char *argv[]) {
pid_t pid;
int i;
int numbPhil = atoi(argv[1]);
if(numbPhil>27){
handle_error("philosopher number should be smaller than 27");
}
if(numbPhil%2==0){
handle_error("not odd number");
}
int miThnk = atoi(argv[2]);
int maThnk = atoi(argv[3]);
int miDin = atoi(argv[4]);
int maDin = atoi(argv[5]);
if(miThnk<1 || miDin<1){
handle_error("Minimum Time Parameter is 1ms");
}
if(maThnk>60000 || maDin > 60000){
handle_error("Maximum Time Parameter is 60s");
}
char* probability = argv[6];
int numDin = atoi(argv[7]);
int tid[numbPhil];
sem_t s[numbPhil];
forks = s;
sem_init(&Quato, 0, numbPhil / 2);
for (i = 0; i <= numbPhil; i++) {
sem_init(&forks[i], 0, 1);
}
for (i = 0; i < numbPhil; ++i) {
WT* arg = (WT * ) malloc(sizeof(WT));
arg->maThnk = maThnk;
arg->miDin = miDin;
arg->miThnk = miThnk;
arg->dst = probability;
arg->maDin = maDin;
arg->numDin = numDin;
arg->numbPhil = numbPhil;
arg->i = i;
pthread_create(&tid[i], NULL, &ThreadWork, (void *)arg);
}
pthread_exit(NULL);
}