-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Elizabeth A. Berzin
committed
Dec 31, 2021
1 parent
4fe81b7
commit 7d35568
Showing
4 changed files
with
410 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,17 @@ | ||
AOCL_COMPILE_CONFIG=$(shell aocl compile-config) | ||
AOCL_LINK_CONFIG=$(shell aocl link-config) | ||
|
||
CC = g++ | ||
CCFLAGS = -std=c++11 -fPIC -g | ||
|
||
DBSCAN : main.o utility.o | ||
$(CC) $(CCFLAGS) $(AOCL_LINK_CONFIG) -lOpenCL -o DBSCAN main.o utility.o | ||
|
||
main.o : main.cpp | ||
$(CC) $(CCFLAGS) $(AOCL_COMPILE_CONFIG) -o main.o -c main.cpp | ||
|
||
utility.o : utility.cpp utility.h | ||
$(CC) $(CCFLAGS) $(AOCL_COMPILE_CONFIG) -o utility.o -c utility.cpp | ||
|
||
clean : | ||
rm -rf DBSCAN *.o |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,97 @@ | ||
__kernel void radius_neighbors(__global float* restrict X, | ||
__global float* restrict Y, | ||
__global uint* restrict neighbCount, | ||
__global uint* restrict neighbIdx, | ||
__global uint* restrict is_core, | ||
uint N, float eps, uint min_samps) { | ||
|
||
uint i = get_global_id(0); | ||
|
||
uint nNeighb = 0; | ||
float dist = 0; | ||
|
||
float local_X = X[i]; | ||
float local_Y = Y[i]; | ||
|
||
for(uint j = 0; j < N; j++) { | ||
dist = (local_X - X[j]) * (local_X - X[j]) + (local_Y - Y[j]) * (local_Y - Y[j]); | ||
if(dist <= eps * eps) { | ||
neighbIdx[N*i + nNeighb] = j; | ||
nNeighb++; | ||
} | ||
} | ||
|
||
neighbCount[i] = nNeighb; | ||
if(nNeighb >= min_samps) { | ||
is_core[i] = 1; | ||
} | ||
|
||
} | ||
|
||
__kernel void radius_neighbors_dists(__global float* restrict dist_matrix, | ||
__global uint* restrict neighbCount, | ||
__global uint* restrict neighbIdx, | ||
__global uint* restrict is_core, | ||
uint N, float eps, uint min_samps) { | ||
|
||
uint i = get_global_id(0); | ||
|
||
uint nNeighb = 0; | ||
float dist = 0; | ||
|
||
for(uint j = 0; j < N; j++) { | ||
dist = dist_matrix[i*N + j]; | ||
if(dist <= eps) { | ||
neighbIdx[N*i + nNeighb] = j; | ||
nNeighb++; | ||
} | ||
} | ||
|
||
neighbCount[i] = nNeighb; | ||
if(nNeighb >= min_samps) { | ||
is_core[i] = 1; | ||
} | ||
|
||
} | ||
|
||
|
||
__kernel void label(__global uint* restrict neighbCount, | ||
__global uint* restrict neighbIdx, | ||
__global uint* restrict visited, | ||
__global int* restrict labels, | ||
__global uint* restrict is_core, | ||
uint N) { | ||
|
||
|
||
int clusterID = 0; | ||
int labelled[7000]; | ||
int counter; | ||
for(int i = 0; i < N; i++) { | ||
if (!visited[i] && is_core[i]) { | ||
visited[i] = 1; | ||
labels[i] = clusterID; | ||
|
||
counter = 0; | ||
labelled[counter] = i; | ||
counter++; | ||
|
||
while(counter != 0) { | ||
int hit = labelled[counter-1]; | ||
counter--; | ||
if(is_core[hit]) { | ||
int nNeighb = neighbCount[hit]; | ||
for(int j = 0; j < nNeighb; j++) { | ||
int nidx = neighbIdx[hit*N + j]; | ||
if (visited[nidx] == 0) { | ||
visited[nidx] = 1; | ||
labelled[counter] = nidx; | ||
counter++; | ||
labels[nidx] = clusterID; | ||
} | ||
} | ||
} | ||
} | ||
clusterID++; | ||
} | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,275 @@ | ||
#include <math.h> | ||
#include <fstream> | ||
#include <sstream> | ||
#include <stdio.h> | ||
#include <string> | ||
#include <vector> | ||
#include <stdlib.h> | ||
#include <iostream> | ||
#include <chrono> | ||
|
||
#include "utility.h" | ||
#include "CL/cl.hpp" | ||
|
||
using namespace std; | ||
|
||
int main(int argc, char *argv[]) { | ||
|
||
|
||
//Processing inputs | ||
cl_uint max_samples = 0; | ||
cl_uint nsectors = 0; | ||
cl_float eps = 0; | ||
cl_uint min_samps = 0; | ||
bool precomputed = false; | ||
string dist_matrix_fname = ""; | ||
string data_fname = ""; | ||
|
||
for(int i_arg = 1; i_arg < argc; i_arg++){ | ||
string arg = argv[i_arg]; | ||
if(arg == "--nsamples" && i_arg+1 < argc) max_samples = atoi(argv[i_arg+1]); | ||
if(arg == "--nsectors" && i_arg+1 < argc) nsectors = atoi(argv[i_arg+1]); | ||
if(arg == "--eps" && i_arg+1 < argc) eps = atof(argv[i_arg+1]); | ||
if(arg == "--min_samps" && i_arg+1 < argc) min_samps = atoi(argv[i_arg+1]); | ||
if(arg == "--precomputed") precomputed = true; | ||
if(arg == "--dist" && i_arg+1 < argc) dist_matrix_fname = argv[i_arg+1]; | ||
if(arg == "--data" && i_arg+1 < argc) data_fname = argv[i_arg+1]; | ||
} | ||
|
||
|
||
// Validating inputs | ||
if(max_samples == 0) { | ||
cout << "ERROR: Enter the number of samples to process" << endl; | ||
return 1; | ||
} | ||
if(nsectors == 0) { | ||
cout << "ERROR: Enter the number of sectors to process" << endl; | ||
return 1; | ||
} | ||
if(eps == 0) { | ||
cout << "ERROR: Enter a value of epsilon" << endl; | ||
return 1; | ||
} | ||
if(min_samps == 0) { | ||
cout << "ERROR: Enter a value of min_samps" << endl; | ||
return 1; | ||
} | ||
if(precomputed && dist_matrix_fname == "") { | ||
cout << "ERROR: Enter a distance matrix filename to run precomputed metric" << endl; | ||
return 1; | ||
} | ||
if(!precomputed && data_fname == "") { | ||
cout << "ERROR: Enter a data filename" << endl; | ||
return 1; | ||
} | ||
|
||
cl_int err; | ||
|
||
|
||
std::vector<cl::Platform> PlatformList; | ||
err = cl::Platform::get(&PlatformList); | ||
checkErr(err, "Get Platform List"); | ||
checkErr(PlatformList.size()>=1 ? CL_SUCCESS : -1, "cl::Platform::get"); | ||
print_platform_info(&PlatformList); | ||
|
||
|
||
//Setup Device | ||
std::vector<cl::Device> DeviceList; | ||
err = PlatformList[0].getDevices(CL_DEVICE_TYPE_ALL, &DeviceList); | ||
checkErr(err, "Get Devices"); | ||
print_device_info(&DeviceList); | ||
|
||
//Setting up Context | ||
cl::Context myContext(DeviceList, NULL, NULL, NULL, &err); | ||
checkErr(err, "Context Constructor"); | ||
|
||
//Create Command Queue | ||
cl::CommandQueue myqueue(myContext, DeviceList[0], CL_QUEUE_PROFILING_ENABLE, &err); | ||
checkErr(err, "Queue Constructor"); | ||
|
||
// Create buffers for input | ||
cl::Buffer bufX(myContext, CL_MEM_READ_ONLY, max_samples * sizeof(cl_float)); | ||
cl::Buffer bufY(myContext, CL_MEM_READ_ONLY, max_samples * sizeof(cl_float)); | ||
cl::Buffer bufDists(myContext, CL_MEM_READ_ONLY, max_samples * max_samples * sizeof(cl_float)); | ||
|
||
|
||
//Create buffers for intermediate values | ||
cl::Buffer bufNeighbCount(myContext, CL_MEM_READ_WRITE, max_samples * sizeof(cl_uint)); | ||
cl::Buffer bufNeighbIdx(myContext, CL_MEM_READ_WRITE, max_samples * max_samples * sizeof(cl_uint)); | ||
cl::Buffer bufIsCore(myContext, CL_MEM_READ_WRITE, max_samples * sizeof(cl_uint)); | ||
cl::Buffer bufLabels(myContext, CL_MEM_READ_WRITE, max_samples * sizeof(cl_int)); | ||
cl::Buffer bufVisited(myContext, CL_MEM_READ_WRITE, max_samples * sizeof(cl_uint)); | ||
|
||
cl_float X[max_samples] __attribute__ ((aligned (64))); | ||
cl_float Y[max_samples] __attribute__ ((aligned (64))); | ||
cl_float dist_matrix[max_samples * max_samples] __attribute__ ((aligned (64))); | ||
|
||
cl_uint neighbCount[max_samples] __attribute__ ((aligned (64))); | ||
cl_uint is_core[max_samples] __attribute__ ((aligned (64))); | ||
cl_uint neighbIdx[max_samples * max_samples] __attribute__ ((aligned (64))); | ||
cl_uint visited[max_samples] __attribute__ ((aligned (64))); | ||
cl_int labels[max_samples] __attribute__ ((aligned (64))); | ||
|
||
vector<float> total_times; | ||
|
||
|
||
string ptmin[] = {"0p6", "0p7", "0p8", "0p9", "1", "1p5", "2"}; | ||
for(int s = 0; s < nsectors; s++) { | ||
|
||
cl_uint vectorSize = 0; | ||
int i = 0; | ||
|
||
string inFileName; | ||
if(!precomputed) { | ||
inFileName = data_fname; //+ "_s" + to_string(s) + "_ptmin1GeV.txt"; | ||
} | ||
else { | ||
inFileName = "/scratch/gpfs/eberzin/tracker_hits_dists/" + dist_matrix_fname + ptmin[s] + "GeV"; | ||
} | ||
|
||
ifstream inFile; | ||
inFile.open(inFileName.c_str()); | ||
if (inFile.is_open()) { | ||
int total_count = 0; | ||
while(!inFile.eof()) { | ||
i = vectorSize; | ||
labels[i] = -1; | ||
neighbCount[i] = 0; | ||
is_core[i] = 0; | ||
visited[i] = 0; | ||
if(!precomputed) { | ||
inFile >> X[i]; | ||
inFile >> Y[i]; | ||
} | ||
else { | ||
string line; | ||
getline(inFile, line); | ||
istringstream line_data(line); | ||
|
||
string hit_dist; | ||
while(line_data >> hit_dist) { | ||
dist_matrix[total_count] = stof(hit_dist); | ||
total_count++; | ||
} | ||
} | ||
vectorSize++; | ||
} | ||
inFile.close(); // Close input file | ||
} | ||
else { //Error message | ||
cerr << "Can't find input file " << inFileName << endl; | ||
} | ||
cout << endl; | ||
vectorSize--; | ||
if(!precomputed) { | ||
err = myqueue.enqueueWriteBuffer(bufX, CL_TRUE, 0, vectorSize * sizeof(cl_float),X); checkErr(err, "WriteBuffer 1"); | ||
err = myqueue.enqueueWriteBuffer(bufY, CL_TRUE, 0, vectorSize * sizeof(cl_float),Y); checkErr(err, "WriteBuffer 2"); | ||
} | ||
else { | ||
err = myqueue.enqueueWriteBuffer(bufDists, CL_TRUE, 0, vectorSize * vectorSize * sizeof(cl_float),dist_matrix); checkErr(err, "WriteBuffer 1"); | ||
} | ||
|
||
err = myqueue.enqueueWriteBuffer(bufNeighbCount, CL_TRUE, 0, vectorSize * sizeof(cl_uint),neighbCount); checkErr(err, "WriteBuffer 3"); | ||
err = myqueue.enqueueWriteBuffer(bufIsCore, CL_TRUE, 0, vectorSize * sizeof(cl_uint),is_core); checkErr(err, "WriteBuffer 4"); | ||
err = myqueue.enqueueWriteBuffer(bufNeighbIdx, CL_TRUE, 0, vectorSize * vectorSize * sizeof(cl_uint),neighbIdx); checkErr(err, "WriteBuffer 5"); | ||
err = myqueue.enqueueWriteBuffer(bufLabels, CL_TRUE, 0, vectorSize * sizeof(cl_int),labels); checkErr(err, "WriteBuffer 5"); | ||
err = myqueue.enqueueWriteBuffer(bufVisited, CL_TRUE, 0, vectorSize * sizeof(cl_uint),visited); checkErr(err, "WriteBuffer 6"); | ||
|
||
|
||
const char *kernel_name_make_graph_1; | ||
if (!precomputed) kernel_name_make_graph_1 = "radius_neighbors"; | ||
else kernel_name_make_graph_1 = "radius_neighbors_dists"; | ||
const char* kernel_name_label = "label"; | ||
|
||
// Creating Binaries | ||
std::ifstream aocx_stream("dbscan.aocx", std::ios::in|std::ios::binary); | ||
checkErr(aocx_stream.is_open() ? CL_SUCCESS:-1, "dbscan.aocx"); | ||
std::string prog(std::istreambuf_iterator<char>(aocx_stream), (std::istreambuf_iterator<char>())); | ||
cl::Program::Binaries mybinaries(DeviceList.size(), std::make_pair(prog.c_str(), prog.length())); | ||
//cl::Program::Binaries mybinaries{std::vector<unsigned char>(prog.begin(), prog.end())}; | ||
cout << "Created Binaries" << endl; | ||
|
||
// Create the Program from the AOCX file. | ||
cl::Program program(myContext, DeviceList, mybinaries, NULL, &err); | ||
checkErr(err, "Program Constructor"); | ||
cout << "Created Program" << endl; | ||
|
||
// Build the program | ||
err= program.build(DeviceList); | ||
checkErr(err, "Build Program"); | ||
|
||
// create the kernel | ||
cl::Kernel kernelGraph1(program, kernel_name_make_graph_1, &err); | ||
checkErr(err, "Kernel Creation 1 "); | ||
|
||
cl::Kernel kernelLabel(program, kernel_name_label, &err); | ||
checkErr(err, "Kernel Creation 1 "); | ||
|
||
|
||
chrono::time_point<std::chrono::high_resolution_clock> start = chrono::high_resolution_clock::now(); | ||
|
||
cout << "LAUNCHED KERNEL" << endl; | ||
|
||
//Launching Neighbor Finding Kernel | ||
if(!precomputed) { | ||
err = kernelGraph1.setArg(0, bufX); checkErr(err, "Arg 0"); | ||
err = kernelGraph1.setArg(1, bufY); checkErr(err, "Arg 1"); | ||
} | ||
else { | ||
err = kernelGraph1.setArg(0, bufDists); checkErr(err, "Arg 0"); | ||
} | ||
|
||
err = kernelGraph1.setArg(2-precomputed, bufNeighbCount); checkErr(err, "Arg 2"); | ||
err = kernelGraph1.setArg(3-precomputed, bufNeighbIdx); checkErr(err, "Arg 4"); | ||
err = kernelGraph1.setArg(4-precomputed, bufIsCore); checkErr(err, "Arg 5"); | ||
err = kernelGraph1.setArg(5-precomputed, vectorSize); checkErr(err, "Arg 6"); | ||
err = kernelGraph1.setArg(6-precomputed, eps); checkErr(err, "Arg 7"); | ||
err = kernelGraph1.setArg(7-precomputed, min_samps); checkErr(err, "Arg 8"); | ||
|
||
err = myqueue.enqueueNDRangeKernel(kernelGraph1, cl::NullRange, cl::NDRange(vectorSize), cl::NullRange, NULL); | ||
checkErr(err, "Kernel Execution"); | ||
myqueue.finish(); | ||
|
||
//Launching Labelling Kernel | ||
|
||
err = kernelLabel.setArg(0, bufNeighbCount); checkErr(err, "Arg 0"); | ||
err= kernelLabel.setArg(1,bufNeighbIdx); checkErr(err, "Arg 1"); | ||
err= kernelLabel.setArg(2,bufVisited); checkErr(err, "Arg 2"); | ||
err= kernelLabel.setArg(3,bufLabels); checkErr(err, "Arg 3"); | ||
err = kernelLabel.setArg(4, bufIsCore); checkErr(err, "Arg 4"); | ||
err = kernelLabel.setArg(5, vectorSize); checkErr(err, "Arg 5"); | ||
|
||
err = myqueue.enqueueNDRangeKernel(kernelLabel, cl::NullRange, cl::NDRange(1), cl::NullRange, NULL); | ||
checkErr(err, "Kernel Execution"); | ||
myqueue.finish(); | ||
|
||
|
||
chrono::time_point<std::chrono::high_resolution_clock> stop = chrono::high_resolution_clock::now(); | ||
auto duration = chrono::duration_cast<chrono::nanoseconds>(stop - start); | ||
|
||
cout << "TIME: " << duration.count() << endl; | ||
total_times.push_back(duration.count()); | ||
|
||
err= myqueue.enqueueReadBuffer(bufLabels, CL_TRUE, 0, vectorSize * sizeof(cl_uint),labels); | ||
|
||
//Printing output labels to a file | ||
ofstream myfile("output_labels/" + dist_matrix_fname + ptmin[s] + "GeV_labels.txt"); | ||
if (myfile.is_open()) | ||
{ | ||
for(int count = 0; count < vectorSize; count ++){ | ||
myfile << labels[count] << endl; | ||
} | ||
myfile.close(); | ||
} | ||
else cout << "Unable to open file"; | ||
|
||
|
||
} | ||
|
||
ofstream output_file2("output_times/" + dist_matrix_fname + "_times_BFS_FPGA.txt"); | ||
ostream_iterator<float> output_iterator2(output_file2, "\n"); | ||
std::copy(total_times.begin(), total_times.end(), output_iterator2); | ||
|
||
return 1; | ||
|
||
} |
Oops, something went wrong.