diff options
author | Gael Guennebaud <g.gael@free.fr> | 2008-07-08 17:20:17 +0000 |
---|---|---|
committer | Gael Guennebaud <g.gael@free.fr> | 2008-07-08 17:20:17 +0000 |
commit | 77a622f2bb3356ee005a9413f6436373ec06efc2 (patch) | |
tree | 14b044c01f19c01102cc275e93e3e6abb6923a39 /bench/benchCholesky.cpp | |
parent | 6f09d3a67d333d68e7c971147ec77600e86e93f3 (diff) |
add Cholesky and eigensolver benchmark
Diffstat (limited to 'bench/benchCholesky.cpp')
-rw-r--r-- | bench/benchCholesky.cpp | 132 |
1 files changed, 132 insertions, 0 deletions
diff --git a/bench/benchCholesky.cpp b/bench/benchCholesky.cpp new file mode 100644 index 000000000..88b52eb4e --- /dev/null +++ b/bench/benchCholesky.cpp @@ -0,0 +1,132 @@ + +// g++ -DNDEBUG -O3 -I.. benchCholesky.cpp -o benchCholesky && ./benchCholesky +// options: +// -DBENCH_GSL -lgsl /usr/lib/libcblas.so.3 +// -DEIGEN_DONT_VECTORIZE +// -msse2 +// -DREPEAT=100 +// -DTRIES=10 +// -DSCALAR=double + +#include <Eigen/Array> +#include <Eigen/Cholesky> +#include <bench/BenchUtil.h> +using namespace Eigen; + +#ifndef REPEAT +#define REPEAT 10000 +#endif + +#ifndef TRIES +#define TRIES 4 +#endif + +typedef float Scalar; + +template <typename MatrixType> +__attribute__ ((noinline)) void benchCholesky(const MatrixType& m) +{ + int rows = m.rows(); + int cols = m.cols(); + + int repeats = (REPEAT*1000)/(rows*rows); + + typedef typename MatrixType::Scalar Scalar; + typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> SquareMatrixType; + + MatrixType a = MatrixType::random(rows,cols); + SquareMatrixType covMat = a * a.adjoint(); + + BenchTimer timerNoSqrt, timerSqrt; + + Scalar acc = 0; + int r = ei_random<int>(0,covMat.rows()-1); + int c = ei_random<int>(0,covMat.cols()-1); + for (int t=0; t<TRIES; ++t) + { + timerNoSqrt.start(); + for (int k=0; k<repeats; ++k) + { + CholeskyWithoutSquareRoot<SquareMatrixType> cholnosqrt(covMat); + acc += cholnosqrt.matrixL().coeff(r,c); + } + timerNoSqrt.stop(); + } + + for (int t=0; t<TRIES; ++t) + { + timerSqrt.start(); + for (int k=0; k<repeats; ++k) + { + Cholesky<SquareMatrixType> chol(covMat); + acc += chol.matrixL().coeff(r,c); + } + timerSqrt.stop(); + } + + if (MatrixType::RowsAtCompileTime==Dynamic) + std::cout << "dyn "; + else + std::cout << "fixed "; + std::cout << covMat.rows() << " \t" + << (timerNoSqrt.value() * REPEAT) / repeats << "s \t" + << (timerSqrt.value() * REPEAT) / repeats << "s"; + + + #ifdef BENCH_GSL + if (MatrixType::RowsAtCompileTime==Dynamic) + { + timerSqrt.reset(); + + gsl_matrix* gslCovMat = gsl_matrix_alloc(covMat.rows(),covMat.cols()); + gsl_matrix* gslCopy = gsl_matrix_alloc(covMat.rows(),covMat.cols()); + + eiToGsl(covMat, &gslCovMat); + for (int t=0; t<TRIES; ++t) + { + timerSqrt.start(); + for (int k=0; k<repeats; ++k) + { + gsl_matrix_memcpy(gslCopy,gslCovMat); + gsl_linalg_cholesky_decomp(gslCopy); + acc += gsl_matrix_get(gslCopy,r,c); + } + timerSqrt.stop(); + } + + std::cout << " | \t" + << timerSqrt.value() * REPEAT / repeats << "s"; + + gsl_matrix_free(gslCovMat); + } + #endif + std::cout << "\n"; + // make sure the compiler does not optimize too much + if (acc==123) + std::cout << acc; +} + +int main(int argc, char* argv[]) +{ + const int dynsizes[] = {4,6,8,12,16,24,32,64,128,256,512,0}; + std::cout << "size no sqrt standard"; + #ifdef BENCH_GSL + std::cout << " GSL (standard + double + ATLAS) "; + #endif + std::cout << "\n"; + + for (uint i=0; dynsizes[i]>0; ++i) + benchCholesky(Matrix<Scalar,Dynamic,Dynamic>(dynsizes[i],dynsizes[i])); + + benchCholesky(Matrix<Scalar,2,2>()); + benchCholesky(Matrix<Scalar,3,3>()); + benchCholesky(Matrix<Scalar,4,4>()); + benchCholesky(Matrix<Scalar,5,5>()); + benchCholesky(Matrix<Scalar,6,6>()); + benchCholesky(Matrix<Scalar,7,7>()); + benchCholesky(Matrix<Scalar,8,8>()); + benchCholesky(Matrix<Scalar,12,12>()); + benchCholesky(Matrix<Scalar,16,16>()); + return 0; +} + |