-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathlab2_bst_test.c
316 lines (258 loc) · 8.89 KB
/
lab2_bst_test.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
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
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
/*
* Operating System Lab
* Lab2 (Synchronization)
*
* lab2_bst_test.c :
* - thread-safe bst test code.
* - coarse-grained, fine-grained lock test code
*
* You can compare single thread result, coarse grained result and fine grained result.
*/
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <time.h>
#include <fcntl.h>
#include <string.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>
#include <unistd.h>
#include "lab2_sync_types.h"
#define LAB2_TYPE_FINEGRAINED 0
#define LAB2_TYPE_COARSEGRAINED 1
#define LAB2_TYPE_SINGLE 2
#define LAB2_OPTYPE_INSERT 0
#define LAB2_OPTYPE_DELETE 1
void lab2_sync_usage(char *cmd)
{
printf("\n Usage for %s : \n",cmd);
printf(" -t: num thread, must be bigger than 0 ( e.g. 4 )\n");
printf(" -c: test node count, must be bigger than 0 ( e.g. 10000000 ) \n");
}
void lab2_sync_example(char *cmd)
{
printf("\n Example : \n");
printf(" #sudo %s -t 4 -c 10000000 \n", cmd);
printf(" #sudo %s -t 4 -c 10000000 \n", cmd);
}
static void print_result(lab2_tree *tree,int num_threads,int node_count ,int is_sync, int op_type ,double time){
char *cond[] = {"fine-grained BST ", "coarse-grained BST", "single thread BST"};
char *op[] = {"insert","delete"};
int result_count=0;
printf("===== Multi thread %s %s experiment =====\n",cond[is_sync],op[op_type]);
printf("\n Experiment info \n");
printf(" test node : %d \n",node_count);
printf(" test threads : %d \n",num_threads);
printf(" execution time : %lf seconds \n\n",time);
printf("\n BST inorder iteration result : \n");
result_count=lab2_node_print_inorder(tree);
printf(" total node count : %d \n\n",node_count);
}
void* thread_job_delete(void *arg){
thread_arg *th_arg = (thread_arg *)arg;
lab2_tree *tree = th_arg->tree;
int is_sync = th_arg->is_sync;
int *data_set = th_arg->data_set;
int start = th_arg->start, end = th_arg->end;
int i;
for(i=start ; i < end; i++ ){
if(is_sync == LAB2_TYPE_FINEGRAINED)
lab2_node_remove_fg(tree, data_set[i]);
else if(is_sync == LAB2_TYPE_COARSEGRAINED)
lab2_node_remove_cg(tree, data_set[i]);
}
}
void* thread_job_insert(void *arg){
thread_arg *th_arg = (thread_arg *)arg;
lab2_tree *tree = th_arg->tree;
int is_sync = th_arg->is_sync;
int *data = th_arg->data_set;
int start = th_arg->start, end = th_arg->end;
int i;
for (i=start ; i < end ; i++) {
lab2_node* node = lab2_node_create(data[i]);
if(is_sync == LAB2_TYPE_FINEGRAINED)
lab2_node_insert_fg(tree, node);
else if(is_sync == LAB2_TYPE_COARSEGRAINED)
lab2_node_insert_cg(tree, node);
}
}
void bst_test(int num_threads,int node_count){
lab2_tree *tree;
lab2_node *node;
struct timeval tv_insert_start, tv_insert_end, tv_delete_start, tv_delete_end, tv_start, tv_end;
int errors,i=0,count=0;
int root_data = 40;
int term = node_count / num_threads, is_sync;
double exe_time=0.0;
thread_arg *threads;
int *data = (int*)malloc(sizeof(int)*node_count);
srand(time(NULL));
for (i=0; i < node_count; i++) {
data[i] = rand();
}
if (!(threads = (thread_arg*)malloc(sizeof(thread_arg) * num_threads)))
abort();
/*
* single thread insert test.
*/
gettimeofday(&tv_start, NULL);
printf("\n");
tree = lab2_tree_create();
for (i=0 ; i < node_count ; i++) {
lab2_node* node = lab2_node_create(data[i]);
lab2_node_insert(tree, node);
}
gettimeofday(&tv_end, NULL);
exe_time = get_timeval(&tv_start, &tv_end);
print_result(tree,num_threads, node_count, LAB2_TYPE_SINGLE,LAB2_OPTYPE_INSERT ,exe_time);
lab2_tree_delete(tree);
/*
* multi therad insert test coarse-grained
*/
is_sync = LAB2_TYPE_COARSEGRAINED;
tree = lab2_tree_create();
gettimeofday(&tv_insert_start, NULL);
for(i=0; i < num_threads ; i++){
thread_arg *th_arg = &threads[i];
th_arg->tree = tree;
th_arg->is_sync = is_sync;
th_arg->data_set = data;
th_arg->start = i*term;
th_arg->end = (i+1)*term;
pthread_create(&threads[i].thread,NULL,thread_job_insert,(void*)th_arg);
}
for (i = 0; i < num_threads; i++)
pthread_join(threads[i].thread, NULL);
gettimeofday(&tv_insert_end, NULL);
exe_time = get_timeval(&tv_insert_start, &tv_insert_end);
print_result(tree,num_threads, node_count, is_sync,LAB2_OPTYPE_INSERT ,exe_time);
lab2_tree_delete(tree);
/*
* multi thread insert test fine-grained
*/
is_sync = LAB2_TYPE_FINEGRAINED;
tree = lab2_tree_create();
gettimeofday(&tv_insert_start, NULL);
for(i=0; i < num_threads ; i++){
thread_arg *th_arg = &threads[i];
th_arg->tree = tree;
th_arg->is_sync = is_sync;
th_arg->data_set = data;
th_arg->start = i*term;
th_arg->end = (i+1)*term;
pthread_create(&threads[i].thread,NULL,thread_job_insert,(void*)th_arg);
}
for (i = 0; i < num_threads; i++)
pthread_join(threads[i].thread, NULL);
gettimeofday(&tv_insert_end, NULL);
exe_time = get_timeval(&tv_insert_start, &tv_insert_end);
print_result(tree,num_threads, node_count, is_sync, LAB2_OPTYPE_INSERT,exe_time);
lab2_tree_delete(tree);
/*
* single thread delete test
*/
tree = lab2_tree_create();
for (i=0 ; i < node_count ; i++) {
lab2_node* node = lab2_node_create(data[i]);
lab2_node_insert(tree, node);
}
gettimeofday(&tv_start, NULL);
for(i=0 ; i < node_count ; i++){
lab2_node_remove(tree,data[i]);
}
gettimeofday(&tv_end, NULL);
exe_time = get_timeval(&tv_start, &tv_end);
print_result(tree ,num_threads, node_count, LAB2_TYPE_SINGLE, LAB2_OPTYPE_DELETE,exe_time);
lab2_tree_delete(tree);
/*
* multi thread delete test coarse-grained
*/
is_sync = LAB2_TYPE_COARSEGRAINED;
tree = lab2_tree_create();
for (i=0; i < node_count; i++) {
node = lab2_node_create(data[i]);
if(is_sync == LAB2_TYPE_FINEGRAINED)
lab2_node_insert_fg(tree,node);
else if(is_sync == LAB2_TYPE_COARSEGRAINED)
lab2_node_insert_cg(tree,node);
}
gettimeofday(&tv_delete_start, NULL);
for(i=0 ; i < num_threads ; i++){
thread_arg *th_arg = &threads[i];
th_arg->tree = tree;
th_arg->is_sync = is_sync;
th_arg->data_set = data;
th_arg->start = i*term;
th_arg->end = (i+1)*term;
pthread_create(&threads[i].thread,NULL,thread_job_delete,(void*)th_arg);
}
for (i = 0; i < num_threads; i++)
pthread_join(threads[i].thread, NULL);
gettimeofday(&tv_delete_end, NULL);
exe_time = get_timeval(&tv_delete_start, &tv_delete_end);
print_result(tree,num_threads, node_count, is_sync,LAB2_OPTYPE_DELETE,exe_time);
lab2_tree_delete(tree);
/*
* multi thread delete test fine-grained
*/
is_sync = LAB2_TYPE_FINEGRAINED;
tree = lab2_tree_create();
for (i=0; i < node_count; i++) {
node = lab2_node_create(data[i]);
if(is_sync == LAB2_TYPE_FINEGRAINED)
lab2_node_insert_fg(tree,node);
else if(is_sync == LAB2_TYPE_COARSEGRAINED)
lab2_node_insert_cg(tree,node);
}
gettimeofday(&tv_delete_start, NULL);
for(i=0 ; i < num_threads ; i++){
thread_arg *th_arg = &threads[i];
th_arg->tree = tree;
th_arg->is_sync = is_sync;
th_arg->data_set = data;
th_arg->start = i*term;
th_arg->end = (i+1)*term;
pthread_create(&threads[i].thread,NULL,thread_job_delete,(void*)th_arg);
}
for (i = 0; i < num_threads; i++)
pthread_join(threads[i].thread, NULL);
gettimeofday(&tv_delete_end, NULL);
exe_time = get_timeval(&tv_delete_start, &tv_delete_end);
print_result(tree ,num_threads, node_count, is_sync, LAB2_OPTYPE_DELETE,exe_time);
//printf("test\n");
lab2_tree_delete(tree);
printf("\n");
free(threads);
free(data);
}
int main(int argc, char *argv[])
{
char op;
int num_threads=0, node_count=0;
int fd;
optind = 0;
while ((op = getopt(argc, argv, "t:c:")) != -1) {
switch (op) {
case 't':
num_threads=atoi(optarg);
break;
case 'c':
node_count = atoi(optarg);
break;
default:
goto INVALID_ARGS;
}
}
if((num_threads>0) && (node_count > 0)){
bst_test(num_threads,node_count);
}else{
goto INVALID_ARGS;
}
return LAB2_SUCCESS;
INVALID_ARGS:
lab2_sync_usage(argv[0]);
lab2_sync_example(argv[0]);
return LAB2_ERROR;
}