GitHub - lilanpei/MultiThread-K-Nearest-Neighbors: Given a set of points in a 2D space, we require to compute in parallel for each one of the points in the set of points the set of k closest points. Point i is the point whose coordinates are listed in line i in the file. The input of the program is a set of floating-point coordinates (one per line, comma separated) and the output is a set of lines each hosting a point id and a list of point ids representing its KNN set ordered with respect to distance.

lilanpei / MultiThread-K-Nearest-Neighbors Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Given a set of points in a 2D space, we require to compute in parallel for each one of the points in the set of points the set of k closest points. Point i is the point whose coordinates are listed in line i in the file. The input of the program is a set of floating-point coordinates (one per line, comma separated) and the output is a set of lin…

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 17 Commits
data		data
figure		figure
results		results
test		test
utilities		utilities
Makefile		Makefile
ff_farm.cpp		ff_farm.cpp
ff_parallel_reduce.cpp		ff_parallel_reduce.cpp
generate_points.py		generate_points.py
outline.pdf		outline.pdf
sequential.cpp		sequential.cpp
threads_barrier.cpp		threads_barrier.cpp
threads_map.cpp		threads_map.cpp
threads_pool.cpp		threads_pool.cpp