qiongsiwu / polybenchomp Goto Github PK

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:

1. Have you ever tried to add pragma for that 'for' loop?.

2. 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.

3. (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 56 of file https:/github.com/qiongsiwu/PolybenchOMP/blob/master/OmpCPU/3DCONV/3DConvolution.c
Here is a part of the code:

nan
for (i = 1; i < (256 - 1); ++i)
{
for (j = 1; j < (256 - 1); ++j)
{
for (k = 1; k < (256 - 1); ++k)
{
B[((i * (256 * 256)) + (j * 256)) + k] = ((((((((((((((c11 * A[(((i - 1) * (256 * 256)) + ((j - 1) * 256)) + (k - 1)]) + (c13 * A[(((i + 1) * (256 * 256)) + ((j - 1) * 256)) + (k - 1)])) + (c21 * A[(((i - 1) * (256 * 256)) + ((j - 1) * 256)) + (k - 1)])) + (c23 * A[(((i + 1) * (256 * 256)) + ((j - 1) * 256)) + (k - 1)])) + (c31 * A[(((i - 1) * (256 * 256)) + ((j - 1) * 256)) +

Sincerely thanks

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 about this for loop:

Can you briefly explain the purpose of using pragma for this case? If the pragma contained reduction and private clauses, can you briefly mention the purposes of variables in those clauses?

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 score.

(Optional) Do you actually run (interpret the code with compilation and pass input/get output) the code and see the optimization of parallelization? 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 125 of file https:/github.com/qiongsiwu/PolybenchOMP/blob/master/OmpCPU/CORR/correlation.c
Here is a part of the code:

#pragma omp parallel for private(j, i)
for (j = 1; j < (M + 1); j++) {
mean[j] = 0.0;

    for (i = 1; i < (N + 1); i++) {
        mean[j] += data[i * (M + 1) + j];
    }

    mean[j] /= (DATA_TYPE)FLOAT_N;
}

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 about this for loop:

1. Can you briefly explain the purpose of using pragma for this case? If the pragma contained reduction and private clauses, can you briefly mention the purposes of variables in those clauses?

2. 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 score.

3. (Optional) Do you actually run (interpret the code with compilation and pass input/get output) the code and see the optimization of parallelization? 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 138 of file https:/github.com/qiongsiwu/PolybenchOMP/blob/master/OmpCPU/CORR/correlation.c
Here is a part of the code:

omp parallel for private(j, i)
for (j = 1; j < (2048 + 1); j++)
{
stddev[j] = 0.0;
for (i = 1; i < (2048 + 1); i++)
{
stddev[j] += (data[(i * (2048 + 1)) + j] - mean[j]) * (data[(i * (2048 + 1)) + j] - mean[j]);
}

stddev[j] /= 3214212.01f;
stddev[j] = sqrt(stddev[j]);
stddev[j] = (stddev[j] <= 0.005f) ? (1.0) : (stddev[j]);
}

Sincerely thanks

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 about this for loop:

1. Can you briefly explain the purpose of using pragma for this case? If the pragma contained reduction and private clauses, can you briefly mention the purposes of variables in those clauses?

2. 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 score.

3. (Optional) Do you actually run (interpret the code with compilation and pass input/get output) the code and see the optimization of parallelization? 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 80 of file https:/github.com/qiongsiwu/PolybenchOMP/blob/master/OmpCPU/SYR2K/syr2k.c
Here is a part of the code:

omp parallel for private(i, j)
for (i = 0; i < 2048; i++)
{
for (j = 0; j < 2048; j++)
{
C[(i * 2048) + j] *= 4546;
}

}

Sincerely thanks

Survey Question on the For loop in source file OmpCPU/2MM/2mm.c line 127
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 about this for loop:

1. Can you briefly explain the purpose of using pragma for this case? If the pragma contained reduction and private clauses, can you briefly mention the purposes of variables in those clauses?

2. 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 score.

3. (Optional) Do you actually run (interpret the code with compilation and pass input/get output) the code and see the optimization of parallelization? 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 127 of file https:/github.com/qiongsiwu/PolybenchOMP/blob/master/OmpCPU/2MM/2mm.c
Here is a part of the code:

omp parallel for private(i, j, k) collapse(2)
for (i = 0; i < 2048; i++)
{
for (j = 0; j < 2048; j++)
{
E[(i * 2048) + j] = 0.0;
for (k = 0; k < 2048; ++k)
{
E[(i * 2048) + j] += C[(i * 2048) + k] * D[(k * 2048) + j];
}

}

}

Sincerely thanks

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 about this for loop:

1. Can you briefly explain the purpose of using pragma for this case? If the pragma contained reduction and private clauses, can you briefly mention the purposes of variables in those clauses?

2. 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 score.

3. (Optional) Do you actually run (interpret the code with compilation and pass input/get output) the code and see the optimization of parallelization? 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 153 of file https:/github.com/qiongsiwu/PolybenchOMP/blob/master/OmpCPU/3MM/3mm.c
Here is a part of the code:

omp parallel for collapse(2) private(i, j, k)
for (i = 0; i < 512; i++)
{
for (j = 0; j < 512; j++)
{
G[(i * 512) + j] = 0;
for (k = 0; k < 512; ++k)
{
G[(i * 512) + j] += E[(i * 512) + k] * F[(k * 512) + j];
}

}

}

Sincerely thanks