-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathconnected_comp_parallel.cu
More file actions
200 lines (160 loc) · 4.84 KB
/
Copy pathconnected_comp_parallel.cu
File metadata and controls
200 lines (160 loc) · 4.84 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
#include <stdio.h>
#include <fstream>
#include <iostream>
#include <stdlib.h>
#include "vector"
#include <sstream>
#include <string>
using namespace std;
#define STD_TEST true
using namespace std;
__global__ void befriend_adjacents(int* adj_lists, int* sizes, int* labels, int* changed) {
int id = threadIdx.x;
// Get start of adj list
int begin = 0;
for (int i = 0; i < id; i++) {
begin += sizes[i];
}
int* list = &adj_lists[begin];
// debug
// if (sizes[id] == 0) {
// debug[id] = -1;
// } else {
// debug[id] = list[0];
// }
int min = labels[id];
for (int i = 0; i < sizes[id]; i++) {
int adj_label = labels[list[i]];
if (adj_label < min) {
min = adj_label;
*changed = 1;
}
}
labels[id] = min;
}
__global__ void init_labels(int* labels) {
int id = threadIdx.x;
labels[id] = id;
}
void print_labels(int* labels, int size) {
ofstream myfile ("cuda_output.group");
cout << "labels: ";
for (int i = 0; i < size; i++) {
cout << labels[i] << " ";
myfile << labels[i] << " ";
}
cout << endl;
myfile << endl;
}
void print_lists(int* adj_lists, int size, int* list_sizes) {
ofstream myfile ("cuda_output.adjlist");
cout << "adjacency lists:" << endl;
int* list = adj_lists;
for (int i = 0; i < size; i++) {
cout << "[";
myfile << i << " ";
for (int j = 0; j < list_sizes[i]; j++) {
cout << " " << list[j] << " ";
myfile << list[j] << " ";
}
cout << "]" << endl;
myfile << endl;
list += list_sizes[i];
}
myfile.close();
}
// void print_debug(int* debug, int size) {
// cout << "debug: ";
// for (int i = 0; i < size; i++) {
// cout << debug[i] << " ";
// }
// cout << endl;
// }
// adj_lists is flattened to 1d array
void cc_para(int* adj_lists, int size, int* list_sizes) {
int* labels = (int*)malloc(size * sizeof(int));
int* d_labels;
int list_size_total = 0;
for (int i = 0; i < size; i++) {
list_size_total += list_sizes[i];
}
cudaMalloc((void**)&d_labels, size * sizeof(int));
init_labels<<<1, size>>>(d_labels);
cudaMemcpy(labels, d_labels, size * sizeof(int), cudaMemcpyDeviceToHost);
int* d_adj_lists;
cudaMalloc((void**)&d_adj_lists, list_size_total * sizeof(int));
cudaMemcpy(d_adj_lists, adj_lists, list_size_total * sizeof(int), cudaMemcpyHostToDevice);
int* d_sizes;
cudaMalloc((void**)&d_sizes, size * sizeof(int));
cudaMemcpy(d_sizes, list_sizes, size * sizeof(int), cudaMemcpyHostToDevice);
int* changed = (int*)malloc(sizeof(int));
int* d_changed;
cudaMalloc((void**)&d_changed, sizeof(int));
*changed = 1;
while (*changed != 0) {
*changed = 0;
cudaMemcpy(d_changed, changed, sizeof(int), cudaMemcpyHostToDevice);
befriend_adjacents<<<1, size>>>(d_adj_lists, d_sizes, d_labels, d_changed);
cudaMemcpy(changed, d_changed, sizeof(int), cudaMemcpyDeviceToHost);
}
cudaMemcpy(labels, d_labels, size * sizeof(int), cudaMemcpyDeviceToHost);
print_labels(labels, size);
cudaFree(d_changed); cudaFree(d_labels); cudaFree(d_changed); cudaFree(d_adj_lists);
free(labels); free(changed);
}
int populate_array(vector<int>* arr, int* len, string file_name) {
ifstream infile(file_name.c_str());
if (!infile.is_open()) {
cout<<"File failed to open"<<endl;
return 0;
}
string line;
while (getline(infile, line))
{
istringstream ss(line);
while (ss)
{
string s;
if (!getline(ss, s, ',')) break;
(*len)++;
cout << " " << atoi(s.c_str());
arr->push_back(atoi(s.c_str()));
}
cout << endl;
}
infile.close();
return 1;
}
int main() {
// int * adj_lists[3];
// int* list0;
// int list1[1] = {2};
// int list2[2] = {1};
// adj_lists[0] = list0;
// adj_lists[1] = list1;
// adj_lists[2] = list2;
/* Simple Test
int adj_lists[4] = {1, 2, 0, 0};
int size = 4;
int sizes[4] = {2, 1, 1, 0};
*/
if(STD_TEST){
int adj_lists[20] = {1, 2, 0, 3, 0, 3, 1, 2, 5, 4, 7, 8, 6, 10, 6, 9, 10, 8, 7, 8};
int size = 11;
int sizes[11] = {2, 2, 2, 2, 1, 1, 2, 2, 3, 1, 2};
print_lists(adj_lists, size, sizes);
cc_para(adj_lists, size, sizes);
}
else{
vector<int> adj_lists;
vector<int> size_lists;
int adj_list_len = 0;
int size_list_len = 0;
populate_array(&adj_lists,&adj_list_len,"rand_graph.list_vec");
populate_array(&size_lists,&size_list_len,"rand_graph.size_vec");
int* adj_lists_data = adj_lists.data();
int* size_lists_data = size_lists.data();
print_lists(adj_lists_data, size_list_len, size_lists_data);
cc_para(adj_lists_data, size_list_len, size_lists_data);
}
}