mirror/eigen
2
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2024-12-15 07:10:37 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update and fix Cholesky mini benchmark

Browse Source
This commit is contained in:
Gael Guennebaud 2016-07-28 11:26:30 +02:00
parent a72752caac
commit 5fbe7aa604
1 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
bench/benchCholesky.cpp
View File

@ -31,7 +31,7 @@ __attribute__ ((noinline)) void benchLLT(const MatrixType& m)
int rows = m.rows(); int rows = m.rows();
int cols = m.cols(); int cols = m.cols();
int cost = 0; double cost = 0;
for (int j=0; j<rows; ++j) for (int j=0; j<rows; ++j)
{ {
int r = std::max(rows - j -1,0); int r = std::max(rows - j -1,0);
@ -78,10 +78,10 @@ __attribute__ ((noinline)) void benchLLT(const MatrixType& m)
else else
std::cout << "fixed "; std::cout << "fixed ";
std::cout << covMat.rows() << " \t" std::cout << covMat.rows() << " \t"
<< (timerNoSqrt.value() * REPEAT) / repeats << "s " << (timerNoSqrt.best()) / repeats << "s "
<< "(" << 1e-6 * cost*repeats/timerNoSqrt.value() << " MFLOPS)\t" << "(" << 1e-9 * cost*repeats/timerNoSqrt.best() << " GFLOPS)\t"
<< (timerSqrt.value() * REPEAT) / repeats << "s " << (timerSqrt.best()) / repeats << "s "
<< "(" << 1e-6 * cost*repeats/timerSqrt.value() << " MFLOPS)\n"; << "(" << 1e-9 * cost*repeats/timerSqrt.best() << " GFLOPS)\n";
#ifdef BENCH_GSL #ifdef BENCH_GSL
@ -119,13 +119,13 @@ __attribute__ ((noinline)) void benchLLT(const MatrixType& m)
int main(int argc, char* argv[]) int main(int argc, char* argv[])
{ {
const int dynsizes[] = {4,6,8,16,24,32,49,64,128,256,512,900,0}; const int dynsizes[] = {4,6,8,16,24,32,49,64,128,256,512,900,1500,0};
std::cout << "size no sqrt standard"; std::cout << "size LDLT LLT";
// #ifdef BENCH_GSL // #ifdef BENCH_GSL
// std::cout << " GSL (standard + double + ATLAS) "; // std::cout << " GSL (standard + double + ATLAS) ";
// #endif // #endif
std::cout << "\n"; std::cout << "\n";
for (uint i=0; dynsizes[i]>0; ++i) for (int i=0; dynsizes[i]>0; ++i)
benchLLT(Matrix<Scalar,Dynamic,Dynamic>(dynsizes[i],dynsizes[i])); benchLLT(Matrix<Scalar,Dynamic,Dynamic>(dynsizes[i],dynsizes[i]));
benchLLT(Matrix<Scalar,2,2>()); benchLLT(Matrix<Scalar,2,2>());