Skip to content

The k-means clustering algorithm that was parallelized using the openmp library. Have also attached the corresponding project report and the presentation. This project was done as a part of the final project submission for the undergraduate course High Performance Computing.

yashwantkeswani/Parallel-K-means-clustering

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 

Repository files navigation

Parallel-K-means-clustering

The k-means clustering algorithm that was parallelized using the openmp library. Have also attached the corresponding project report and the presentation. This project was done as a part of the final project submission for the undergraduate course High Performance Computing. Compile it using the following command: gcc k_means_parallel.c -fopenmp -lm

and then ./a.out(name of the executable) no_of_rows/datapoints no_of_columns/dimensions no_of_clusters maximum_iterations no_of_threads

The no_of_threads should be equal to the number of cores you have. It works out the best in that case.	

Team:

  1. Akshar Varma
  2. Yashwant Keswani

About

The k-means clustering algorithm that was parallelized using the openmp library. Have also attached the corresponding project report and the presentation. This project was done as a part of the final project submission for the undergraduate course High Performance Computing.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages