Jump to content

Livermore loops

From Wikipedia, the free encyclopedia

Livermore loops (also known as the Livermore Fortran kernels or LFK) is a benchmark for parallel computers. It was created by Francis H. McMahon from scientific source code run on computers at Lawrence Livermore National Laboratory. It consists of 24 do loops, some of which can be vectorized, and some of which cannot.

The benchmark was published in 1986 in Livermore fortran kernels: A computer test of numerical performance range.[1]

The Livermore loops were originally written in Fortran, but have since been ported to many programming languages.

Each loop carries out a different mathematical kernel . Those kernels[2] are:

References

[edit]
  1. ^ F. H. McMahon. Livermore fortran kernels: A computer test of numerical performance range. Technical Report UCRL-53745, Lawrence Livermore National Laboratory, Livermore, CA, December 1986. NTIS report #DE87009360.
  2. ^ Xingfu Wu. Performance Evaluation, Prediction and Visualization of Parallel Systems. Springer, 1999. ISBN 0-7923-8462-8. Page 144.
[edit]