-
Notifications
You must be signed in to change notification settings - Fork 2
/
exp.cu
283 lines (248 loc) · 8.45 KB
/
exp.cu
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
#include "graph.hxx"
#include "coo_d.hxx"
#include "coo_h.h"
#include <iostream>
#include <vector>
#include <time.h>
#include <map>
#include <utility>
#include <algorithm>
/* intital graph configuration */
size_t MAX_V; // max number of vertices
const size_t N = 10000000;
size_t MAX; // max number of nodes / memory limit
size_t test_times; // test times
size_t v_num; // initial number of vertices
size_t e_num; // intinal number of edges, e_num should smaller than MAX+test_times
size_t* v_list; // intinal vertex list
size_t* row_idx; // initial row index (source of each edge)
size_t* col_idx; // initial col index (target of each edge)
int* value; // initial weight for each edge
/* configuration for the kernel call */
size_t number_of_blocks;
size_t threads_per_block;
/* randomly create an intial graph in the host according to
number of vertices, edges and max number of vertices */
void init(){
if(v_num>MAX_V/2){
std::vector<int> v;
for(int i=0;i<MAX_V;i++){
v.push_back(i);
}
std::random_shuffle(v.begin(),v.end());
for(int i=0;i<v_num;i++){
v_list[i]=v[i];
}
}
else{
std::map<int,int> mp;
while(mp.size()<v_num){
int cx=rand()%MAX_V;
if(mp.count(cx)){
continue;
}
v_list[mp.size()]=cx;
mp[cx]=1;
}
}
if(e_num>v_num*v_num/4){
std::vector<std::pair<int,int> > v;
for(int i=0;i<v_num;i++){
for(int j=0;j<v_num;j++){
v.push_back(std::make_pair(v_list[i],v_list[j]));
}
}
std::random_shuffle(v.begin(),v.end());
for(int i=0;i<e_num;i++){
row_idx[i]=v[i].first;
col_idx[i]=v[i].second;
value[i]=rand();
}
}
else{
std::map<std::pair<int,int>,int> mp;
while(mp.size()<e_num){
int a=rand()%v_num,b=rand()%v_num,c=rand();
if(mp.count(std::make_pair(a,b))){
continue;
}
int idx=mp.size();
row_idx[idx]=v_list[a];
col_idx[idx]=v_list[b];
value[idx]=c;
mp[std::make_pair(a,b)]=c;
}
}
}
template<typename weight_t,
template<typename> typename graph_view_t>
void test(graph<weight_t,graph_view_t> g){
double time_taken;
clock_t start, end;
clock_t T_start, T_end;
/* create an initial graph in host */
init();
printf("\n ----------------------------Test begin------------------------------------\n");
/* test initialization */
T_start = clock();
start = clock();
g.init(v_list, v_num, row_idx, col_idx, value, e_num, number_of_blocks, threads_per_block, MAX);
end = clock();
time_taken = ((double)(end - start))/ CLOCKS_PER_SEC;
printf("initialization: %.2lf s\n", time_taken);
/* insert test_times edges */
start = clock();
for (int i = 0; i < test_times; i ++) {
g.insert_vertex(rand() % MAX_V);
}
end = clock();
time_taken = ((double)(end - start))/ CLOCKS_PER_SEC;
printf("insert %d vertices: %.2lf s\n", test_times, time_taken);
/* insert test_times edges */
start = clock();
for (int i = 0; i < test_times; i ++) {
g.insert_edge(rand() % MAX_V, rand() % MAX_V, rand() % MAX_V);
}
end = clock();
time_taken = ((double)(end - start))/ CLOCKS_PER_SEC;
printf("insert %d edges: %.2lf s\n", test_times, time_taken);
/* check test_times edges */
start = clock();
for (int i = 0; i < test_times; i ++) {
g.check_edge(rand() % MAX_V, rand() % MAX_V);
}
end = clock();
time_taken = ((double)(end - start))/ CLOCKS_PER_SEC;
printf("check %d edges: %.2lf s\n", test_times, time_taken);
/* check test_times vertices */
start = clock();
for (int i = 0; i < test_times; i ++) {
g.check_vertex(rand() % MAX_V);
}
end = clock();
time_taken = ((double)(end - start))/ CLOCKS_PER_SEC;
printf("check %d vertices: %.2lf s\n", test_times, time_taken);
/* get weight*/
start = clock();
for (int i = 0; i < test_times; i ++) {
g.get_weight(rand() % MAX_V, rand() % MAX_V, -1);
}
end = clock();
time_taken = ((double)(end - start))/ CLOCKS_PER_SEC;
printf("get weight of %d edges: %.2lf s\n", test_times, time_taken);
/* get in degree of test_times vertices */
start = clock();
for (int i = 0; i < test_times; i ++) {
g.get_in_degree(rand() % MAX_V);
}
end = clock();
time_taken = ((double)(end - start))/ CLOCKS_PER_SEC;
printf("get in degree of %d vertices: %.2lf s\n", test_times, time_taken);
/* get out degree of test_times vertices */
start = clock();
for (int i = 0; i < test_times; i ++) {
g.get_out_degree(rand() % MAX_V);
}
end = clock();
time_taken = ((double)(end - start))/ CLOCKS_PER_SEC;
printf("get out degree of %d vertices: %.2lf s\n", test_times, time_taken);
/* get number of neighbors test_times vertices */
start = clock();
for (int i = 0; i < test_times; i ++) {
g.get_num_neighbors(rand() % MAX_V);
}
end = clock();
time_taken = ((double)(end - start))/ CLOCKS_PER_SEC;
printf("get num of neighbors of %d vertices: %.2lf s\n", test_times, time_taken);
/* get source of test_times vertices */
start = clock();
for (int i = 0; i < test_times; i ++) {
g.get_source_vertex(rand() % MAX_V);
}
end = clock();
time_taken = ((double)(end - start))/ CLOCKS_PER_SEC;
printf("get source of %d vertices: %.2lf s\n", test_times, time_taken);
/* get destination of test_times vertices */
start = clock();
for (int i = 0; i < test_times; i ++) {
g.get_destination_vertex(rand() % MAX_V);
}
end = clock();
time_taken = ((double)(end - start))/ CLOCKS_PER_SEC;
printf("get destination of %d vertices: %.2lf s\n", test_times, time_taken);
/* delete test_times edges */
start = clock();
for (int i = 0; i < test_times; i ++) {
g.delete_edge(rand() % MAX_V, rand() % MAX_V);
}
end = clock();
time_taken = ((double)(end - start))/ CLOCKS_PER_SEC;
printf("delete %d edges: %.2lf s\n", test_times, time_taken);
/* delete test_times vertices */
start = clock();
for (int i = 0; i < test_times; i ++) {
g.delete_vertex(rand() % MAX_V);
}
end = clock();
time_taken = ((double)(end - start))/ CLOCKS_PER_SEC;
printf("delete %d vertices: %.2lf s\n", test_times, time_taken);
T_end = clock();
time_taken = ((double)(T_end - T_start))/ CLOCKS_PER_SEC;
printf("Total time: %.2lf s\n", time_taken);
// /* test print*/
// g.print();
// /* 2 test get number of vertices and edges */
// printf("\ntest get number of vertices and edges\n");
// printf("number of vertices: %lu, ", g.get_number_of_vertices());
// printf("number of edges: %lu\n", g.get_number_of_edges());
printf("----------------------------Test end---------------------------------------\n");
}
int main(){
/* set the random seed and clock */
srand(0);
/* type in the configuration of the experiment*/
printf("GPU(0)\\CPU(1) | MAX_V | v_num | e_num | test_times | MAX | grid_size | block_size\n");
int CGPU;
scanf("%d%lu%lu%lu%lu%lu",&CGPU,&MAX_V,&v_num,&e_num,&test_times,&MAX);
v_list=(size_t*)malloc(v_num*sizeof(size_t));
row_idx=(size_t*)malloc(e_num*sizeof(size_t));
col_idx=(size_t*)malloc(e_num*sizeof(size_t));
value=(int*)malloc(e_num*sizeof(int));
/* create an empty graph*/
if(CGPU==0){
scanf("%lu%lu",&number_of_blocks,&threads_per_block);
graph<int,coo_d> g;
test(g);
}
else{
graph<int,coo_h> g;
test(g);
}
free(v_list);
free(row_idx);
free(col_idx);
free(value);
// /* print the initial graph we input */
// printf("The initial graph we input: \n");
// printf("v_list: ");
// for(int i = 0; i < v_num; i++){
// printf("%lu ", v_list[i]);
// }
// printf("\n");
// printf("row_idx: ");
// for(int i = 0; i < e_num; i++){
// printf("%lu ", row_idx[i]);
// }
// printf("\n");
// printf("col_idx: ");
// for(int i = 0; i < e_num; i++){
// printf("%lu ", col_idx[i]);
// }
// printf("\n");
// printf("value: ");
// for(int i = 0; i < e_num; i++){
// printf("%d ", value[i]);
// }
// printf("\n");
return 0;
}