search

UMD-ARLIS / Graph-Benchmarking-Project

This repository contains work towards creating a comprehensive cross-platform graph processing benchmark for Community Detection and Subgraph Isomorphism problems. The repository is NOT YET COMPLETE and should not be used outside of a preliminary development perspective.
2 stars 0 forks source link

Clean Up the code for the Serial Implementation of Louvain on CPU. #1

Open amirmghaemi opened 1 year ago

amirmghaemi commented 1 year ago

See: Serial Implementation of Louvain

This issue includes: a. Remove redundant or old files b. Updating makefile(s) so that we can compile it in: (i) Optimized format for measuring execution time (i) Debug format for counting edge traversals, etc. c. Instrumenting code to allow us to count the ’traversals’ during the algorithm (add a counter, use instruction counting etc). d. Double check the licensing of code allows us to use/modify it. e. Add appropriate citations/links to original docs and material in the git repo.

amirmghaemi commented 1 year ago

Merging this issue into the Parallel Louvain algorithm for CPU. https://github.com/UMD-ARLIS/Graph-Benchmarking-Project/issues/2