-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
381 lines (355 loc) · 11.2 KB
/
main.cpp
File metadata and controls
381 lines (355 loc) · 11.2 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
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
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
#include <iostream>
#include "Layer.h"
#include "FullyConnectedLayer.h"
#include "CudaWrapper.h"
#include "Sigmoid.h"
#include "InputLayer.h"
#include "NeuralNetwork.h"
#include "Matrix.h"
#include <time.h>
#include <string>
using namespace std;
void blockAdd(int* array, int size, int cellSize, int maxSize)
{
for(int j=0; j<((size/maxSize)/maxSize) + 1; j++){
int* sBlock = new int[maxSize];
for(int i=0; i<maxSize; i++)
{
int tid = i;
int blockid = j;
int index = (blockid*maxSize + tid)*maxSize;
if(index<size){
sBlock[i] = array[index];
cout << sBlock[i] << ", ";
}
}
cout << endl;
for(int i=0; i<maxSize; i++)
{
int tid = i;
int blockid = j;
int index = (blockid*maxSize + tid)*maxSize;
int global_start = ((index)/cellSize)*cellSize;
int global_end = global_start + cellSize;
int block_start = ((index/maxSize/maxSize))*maxSize*maxSize; // Global Index block starts at
int first_elem_index = (index - block_start)/(cellSize);
cout << first_elem_index << endl;
if(global_start - block_start < 0)
{
}
}
for(int i=0; i<maxSize; i++)
{
int tid = i;
int blockid = j;
int index = (blockid*maxSize + tid)*maxSize;
if(index<size)
array[index] = sBlock[i];
}
delete[] sBlock;
}
}
void nuclearAdd(int* array, int size, int cellSize, int maxSize, int stride)
{
if(stride>cellSize)
return;
int k=0;
for(int j=0; j<(size/maxSize) + 1; j++){
int* sBlock = new int[maxSize];
for(int i=0; i<maxSize; i++)
{
int index = j*maxSize + i;
if(index<size)
sBlock[i] = array[index];
}
for(int i=0; i<maxSize; i++)
{
int tid = i;
int blockid = j;
int index = blockid*maxSize + tid;
int global_start = ((index)/cellSize)*cellSize;
int local_start = (index / maxSize)*maxSize;
int offset = global_start - local_start;
int local_index = index % cellSize;
int start = offset;
if(offset<0)
start = 0;
int local_end = offset + cellSize;
if(index < size){
int t_1 = offset+local_index*2*stride;
if(offset<0)
t_1 = tid*2*stride;
int t_2 = t_1 + stride;
if(t_2 < local_end && t_1%2==start%2 && t_2 < maxSize){
sBlock[t_1] = sBlock[t_1] + sBlock[t_2];
sBlock[t_2] = 0;
}
}
}
for(int i=0; i<maxSize; i++)
{
int index = j*maxSize + i;
if(index<size)
array[index] = sBlock[i];
}
delete[] sBlock;
}
}
void sequentialBlockAdd(int* array, int size, int cellSize, int maxSize)
{
for(int i=0; i<(size/cellSize); i++)
{
int tid = i;
int global_start = tid*cellSize;
int global_end = global_start + cellSize;
int next_block = ((global_start+maxSize)/maxSize)*maxSize;
for(int j=0; j<cellSize/maxSize; j++)
{
if(next_block < global_end){
array[global_start]+=array[next_block];
array[next_block] = 0;
}
next_block+=maxSize;
}
}
}
void sequentialBlockAdd2(int* array, int size, int cellSize, int maxSize)
{
for(int i=0; i<(size/maxSize)+1; i++)
{
int index = i*maxSize;
int global_start = ((index)/cellSize)*cellSize;
if(index!=global_start){
array[global_start]+=array[index];
array[index] = 0;
}
}
}
void nuclearPrint(int* array, int size, int cellSize, int maxSize)
{
for(int i=0; i<size; i++)
{
if(i%cellSize==0)
{
cout << "[" << array[i] << "],";
}else if(i%maxSize==0){
cout << "(" << array[i] << "),";
}else{
cout << array[i] << ",";
}
}
cout << endl;
}
int main(int argc, char **argv)
{
int device = 0;
if(argc>1)
device = atoi(argv[1]);
CudaWrapper::setDevice(device);
CudaWrapper::profileDevices();
//*
MatrixUtils::Matrix inputTrainData("TrainingData/CIFAR10_TrainInputs.csv");
//MatrixUtils::Matrix inputTestData("TrainingData/MNIST_TestInputs.csv");
MatrixUtils::Matrix trainLabels("TrainingData/CIFAR10_TrainOutputs.csv");
//MatrixUtils::Matrix testLabels("TrainingData/MNIST_TestOutputs.csv");
/*
MatrixUtils::Matrix inputTrainData("TrainingData/simpleInputs.csv");
MatrixUtils::Matrix trainLabels("TrainingData/simpleOutputs.csv");
/*/
//*
int inputSize = inputTrainData.getColumns();
int outputSize = trainLabels.getColumns();
int trainNum = inputTrainData.getRows();
cout << "Train Num " << trainNum << endl;
float* d_inputDataSample = CudaWrapper::loadArrayOnGPU(inputTrainData.getArray()[0], inputSize);
float* d_outputSample = CudaWrapper::loadArrayOnGPU(trainLabels.getArray()[0], outputSize);
//*/
/*
int inputSize = 8;
int outputSize = 11;
float* testInput = new float[inputSize];
float* correctOutput = new float[outputSize];
for(int i=0; i<inputSize; i++)
testInput[i] = 1;
for(int i=0; i<outputSize; i++)
correctOutput[i] = 1;
float* d_testInput = CudaWrapper::loadArrayOnGPU(testInput, inputSize);
float* d_correctOutput = CudaWrapper::loadArrayOnGPU(correctOutput, outputSize);
Layer* input = new InputLayer(inputSize);
Layer* fullyConnected = new FullyConnectedLayer(outputSize, "");
fullyConnected->setPreviousLayer(input);
input->setNeurons(testInput);
fullyConnected->feedForward(testInput);
/*
float* returnVal = fullyConnected->propogateBack(correctOutput);
for(int i=0; i<inputSize; i++)
cout << returnVal[i] << ",";
cout << endl;
*/
//float* returnVal;
/*
input->loadGPU();
fullyConnected->loadGPU();
input->setNeurons(d_testInput);
fullyConnected->feedForward(d_testInput);
returnVal = fullyConnected->propogateBack(d_correctOutput);
float* currentOut = CudaWrapper::unloadArrayFromGPU(returnVal, inputSize);
for(int i=0; i<inputSize; i++)
cout << currentOut[i] << ",";
cout << endl;
//*/
//*
NeuralNetwork network;
//network.setTestData(inputTestData.getArray(), testLabels.getArray(), 10000);
network.addLayer(new InputLayer(inputSize));
network.addLayer(new FullyConnectedLayer(10000, "test"));
network.addLayer(new FullyConnectedLayer(outputSize, "test"));
network.setTrainingData(inputTrainData.getArray(), trainLabels.getArray(), 50000);
network.setLearningRate(0.0005);
network.printTopology();
network.loadGPU();
for(int i=0; i<50; i++){
network.train();
}
//network.unloadGPU();
//*
//network.train();
/*
network.setInput(inputTrainData.getArray()[0]);
network.feedForward();
float* out = network.getOutput();
for(int i=0; i<10; i++)
{
//cout << out[i] << ",";
}
network.setInput(inputTrainData.getArray()[1]);
//network.feedForward();
cout << endl;
network.loadGPU();
network.setInput(d_inputDataSample);
network.feedForward();
for(int i=0; i<5; i++){
//network.train();
}
cout << "Unloading" << endl;
network.unloadGPU();
float* out2 = network.getOutput();
for(int i=0; i<10; i++)
{
//cout << out2[i] << ",";
}
cout << endl;
//*/
//network.train();
//network.printTopology();
//network.test(200*784, 200);
/*
long time = clock();
float avgTime = 0;
int iterations = 6;
cout << "Iterations: " << iterations << endl;
//*
for(int i=0; i<iterations; i++){
time = clock();
network.setInput( inputTrainData.getArray()[0]);
network.feedForward();
network.propogateBack(trainLabels.getArray()[0]);
long time2 = clock();
float timeElapsed = (time2 - time) / ((float) CLOCKS_PER_SEC);
avgTime+=timeElapsed;
}
cout << "CPU: " << endl;
cout << " Time Elapsed: " << avgTime*2 << endl;
avgTime/=iterations;
cout << " Avg Time: " << avgTime << endl;
network.loadGPU();
avgTime = 0;
for(int i=0; i<iterations; i++){
time = clock();
network.setInput(d_inputDataSample);
network.feedForward();
network.propogateBack(d_outputSample);
long time2 = clock();
float timeElapsed = (time2 - time) / ((float) CLOCKS_PER_SEC);
avgTime+=timeElapsed;
}
cout << "GPU:" << endl;
cout << " Time Elapsed: " << avgTime*2 << endl;
avgTime/=iterations;
cout << " Avg Time: " << avgTime << endl;
network.unloadGPU();
cout << "Done" << endl;
//*/
/*
for(int i=0; i<1000; i++)
network.train();
for(int i=0; i<trainNum; i++)
{
network.setInput(inputTrainData.getArray()[i]);
network.loadGPU();
network.feedForward();
network.unloadGPU();
float* out = network.getOutput();
for(int j=0; j<outputSize; j++)
{
cout << (int) (out[j]+0.5) << ",";
}
cout << endl;
}
//*/
return 0;
}
/*
void nuclearAddWorking(int* array, int size, int cellSize, int maxSize, int stride)
{
if(stride>cellSize)
return;
int k=0;
for(int j=0; j<(size/maxSize) + 1; j++){
int* sBlock = new int[maxSize];
for(int i=0; i<maxSize; i++)
{
int index = j*maxSize + i;
if(index<size)
sBlock[i] = array[index];
}
for(int i=0; i<maxSize; i++)
{
int tid = i;
int blockid = j;
int index = blockid*maxSize + tid;
int global_start = ((index)/cellSize)*cellSize;
int local_start = (index / maxSize)*maxSize;
int offset = global_start - local_start;
int localIndex = index % cellSize;
int start = offset;
if(offset<0)
start = 0;
int local_end = offset + cellSize;
int k = localIndex;
if(index < size){
//cout << "[" << tid - start << "]" << start << "_" << local_end << ",";
int t_1 = tid;
int t_2 = t_1 + stride;
//cout << "[" << index << "]" << t_1 << ", " << t_2 << " : " << local_end;
cout << start;
if(t_2 < local_end && t_2 < maxSize && t_1%2==start%2){
cout << "[PASS]";
//cout << "[" << index << "]" << t_1 << ", " << t_2 << " : " << local_end << endl;
sBlock[t_1] = sBlock[t_1] + sBlock[t_2];
sBlock[t_2] = 0;
}
cout << endl;
}
}
for(int i=0; i<maxSize; i++)
{
int index = j*maxSize + i;
if(index<size)
array[index] = sBlock[i];
}
delete[] sBlock;
}
cout << endl;
}
*/