Skip to main content

PWR054: Consider applying vectorization to scalar reduction loop

Issue​

The loop containing a scalar reduction pattern can be sped up using vectorization.

Actions​

Implement a version of the scalar reduction loop using an Application Program Interface (API) that enables vectorization. Codee assists the programmer by providing source code rewriting capabilities using compiler directives provided by OpenMP standard, GNU compiler, LLVM compiler and Intel compiler.

Relevance​

Vectorizing a loop is one of the ways to speed it up. Vectorization is widely used in modern computers, but writing vectorized code is not straightforward. Essentially, the programmer must explicitly specify how to execute the loop in vector mode on the hardware, as well as add the appropriate synchronization to avoid race conditions at runtime. Typically, the compiler does a good job in vectorization, so the biggest challenge is to vectorize loops manually beyond the capabilities of the compiler.

note

Vectorizing scalar reduction loops incurs an overhead due to the synchronization needed to avoid race conditions and ensure the correctness of the code. Note appropriate data scoping of shared and private variables is still a must.

Code example​

C​

double example(double *A, int n) {
  double sum = 0.0;

  for (int i = 0; i < n; ++i) {
    sum += A[i];
  }

  return sum;
}

The loop body has a scalar reduction pattern, meaning that each iteration of the loop reduces its computational result to a single value; in this case, sum. Thus, any two iterations of the loop executing concurrently can potentially update the value of the scalar sum at the same time. This creates a potential race condition that must be handled through appropriate synchronization.

The code snippet below shows an implementation that uses the OpenMP compiler directives to explicitly vectorize the loop. Note the synchronization added to avoid race conditions:

double example(double *A, int n) {
  double sum = 0.0;

  #pragma omp simd reduction(+: sum)
  for (int i = 0; i < n; ++i) {
    sum += A[i];
  }

  return sum;
}

Fortran​

function example(A) result(sum)
  implicit none
  real(kind=8), intent(in) :: A(:)
  real(kind=8) :: sum
  integer :: i

  sum = 0.0
  do i = 1, size(A, 1)
    sum = sum + A(i)
  end do
end function example

The loop body has a scalar reduction pattern, meaning that each iteration of the loop reduces its computational result to a single value; in this case, sum. Thus, any two iterations of the loop executing concurrently can potentially update the value of the scalar sum at the same time. This creates a potential race condition that must be handled through appropriate synchronization.

The code snippet below shows an implementation that uses the OpenMP compiler directives to explicitly vectorize the loop. Note the synchronization added to avoid race conditions:

function example(A) result(sum)
  implicit none
  real(kind=8), intent(in) :: A(:)
  real(kind=8) :: sum
  integer :: i

  sum = 0.0
  !$omp simd reduction(+: sum)
  do i = 1, size(A, 1)
    sum = sum + A(i)
  end do
end function example

References​