You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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 158 of file https:/github.com/atmughrabi/AccelGraph/blob/master/02_capi_graph/src/algorithms/capi/betweennessCentrality.c
Here is a part of the code:
nan
for (i = 0; i < stats->num_vertices; i++)
{
free(stats->predecessors[i].nodes);
}
Sincerely thanks
The text was updated successfully, but these errors were encountered:
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
The for loop is from line 158 of file https:/github.com/atmughrabi/AccelGraph/blob/master/02_capi_graph/src/algorithms/capi/betweennessCentrality.c
Here is a part of the code:
nan
for (i = 0; i < stats->num_vertices; i++)
{
free(stats->predecessors[i].nodes);
}
Sincerely thanks
The text was updated successfully, but these errors were encountered: