An OpenMP & C implementation of Newman's leading eigenvector algorithm for community detection. An assessment item for CAB401 (High Performance & Parallel Computing), Semester 2, 2020.
Hello Sir/ Madam
We are from a research group at Iowa State University, USA. We want to do a survey on Github developers on the methods they used for paralleling their code. To do the survey, We want to ask three questions:
Have you ever tried to add pragma for that 'for' loop?.
How much confidence do you have about the correctness of this implementation? You can choose from 1-5 with 1 as the lowest confidence score and 5 as the highest confidence.
(Optional) Do you actually run (interpret the code with compilation and pass input/get output) the code? Yes/No
If yes, can you provide the information of what are the input and expected output of this program (the input that caused the program to run through this for-loop).
The for loop is from line 57 of file https:/github.com/davidjmstewart/ParallelNewmanModularity/blob/master/benchmarking/subgraph_modularity_matrix/sgmm_benchmarking.c
Here is a part of the code:
nan
for (i = 0; i < currentMatrixSize; i++)
{
B_g[(i * currentMatrixSize) + i] -= Bsum[i];
}