mirror of
https://gitlab.com/libeigen/eigen.git
synced 2026-04-10 11:34:33 +08:00
Clang-format tests, examples, libraries, benchmarks, etc.
This commit is contained in:
Antonio Sánchez
committed by
Rasmus Munk Larsen
Rasmus Munk Larsen
parent
3252ecc7a4
commit
46e9cdb7fe
167
bench/spmv.cpp
167
bench/spmv.cpp
@@ -1,5 +1,7 @@
|
||||
|
||||
//g++-4.4 -DNOMTL -Wl,-rpath /usr/local/lib/oski -L /usr/local/lib/oski/ -l oski -l oski_util -l oski_util_Tid -DOSKI -I ~/Coding/LinearAlgebra/mtl4/ spmv.cpp -I .. -O2 -DNDEBUG -lrt -lm -l oski_mat_CSC_Tid -loskilt && ./a.out r200000 c200000 n100 t1 p1
|
||||
// g++-4.4 -DNOMTL -Wl,-rpath /usr/local/lib/oski -L /usr/local/lib/oski/ -l oski -l oski_util -l oski_util_Tid -DOSKI
|
||||
// -I ~/Coding/LinearAlgebra/mtl4/ spmv.cpp -I .. -O2 -DNDEBUG -lrt -lm -l oski_mat_CSC_Tid -loskilt && ./a.out
|
||||
// r200000 c200000 n100 t1 p1
|
||||
|
||||
#define SCALAR double
|
||||
|
||||
@@ -8,7 +10,7 @@
|
||||
#include "BenchTimer.h"
|
||||
#include "BenchSparseUtil.h"
|
||||
|
||||
#define SPMV_BENCH(CODE) BENCH(t,tries,repeats,CODE);
|
||||
#define SPMV_BENCH(CODE) BENCH(t, tries, repeats, CODE);
|
||||
|
||||
// #ifdef MKL
|
||||
//
|
||||
@@ -34,8 +36,7 @@
|
||||
//
|
||||
// #endif
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
int main(int argc, char *argv[]) {
|
||||
int size = 10000;
|
||||
int rows = size;
|
||||
int cols = size;
|
||||
@@ -44,106 +45,93 @@ int main(int argc, char *argv[])
|
||||
int repeats = 2;
|
||||
|
||||
bool need_help = false;
|
||||
for(int i = 1; i < argc; i++)
|
||||
{
|
||||
if(argv[i][0] == 'r')
|
||||
{
|
||||
rows = atoi(argv[i]+1);
|
||||
}
|
||||
else if(argv[i][0] == 'c')
|
||||
{
|
||||
cols = atoi(argv[i]+1);
|
||||
}
|
||||
else if(argv[i][0] == 'n')
|
||||
{
|
||||
nnzPerCol = atoi(argv[i]+1);
|
||||
}
|
||||
else if(argv[i][0] == 't')
|
||||
{
|
||||
tries = atoi(argv[i]+1);
|
||||
}
|
||||
else if(argv[i][0] == 'p')
|
||||
{
|
||||
repeats = atoi(argv[i]+1);
|
||||
}
|
||||
else
|
||||
{
|
||||
for (int i = 1; i < argc; i++) {
|
||||
if (argv[i][0] == 'r') {
|
||||
rows = atoi(argv[i] + 1);
|
||||
} else if (argv[i][0] == 'c') {
|
||||
cols = atoi(argv[i] + 1);
|
||||
} else if (argv[i][0] == 'n') {
|
||||
nnzPerCol = atoi(argv[i] + 1);
|
||||
} else if (argv[i][0] == 't') {
|
||||
tries = atoi(argv[i] + 1);
|
||||
} else if (argv[i][0] == 'p') {
|
||||
repeats = atoi(argv[i] + 1);
|
||||
} else {
|
||||
need_help = true;
|
||||
}
|
||||
}
|
||||
if(need_help)
|
||||
{
|
||||
if (need_help) {
|
||||
std::cout << argv[0] << " r<nb rows> c<nb columns> n<non zeros per column> t<nb tries> p<nb repeats>\n";
|
||||
return 1;
|
||||
}
|
||||
|
||||
std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. (" << repeats << " repeats, and " << tries << " tries)\n\n";
|
||||
std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. (" << repeats
|
||||
<< " repeats, and " << tries << " tries)\n\n";
|
||||
|
||||
EigenSparseMatrix sm(rows,cols);
|
||||
EigenSparseMatrix sm(rows, cols);
|
||||
DenseVector dv(cols), res(rows);
|
||||
dv.setRandom();
|
||||
|
||||
BenchTimer t;
|
||||
while (nnzPerCol>=4)
|
||||
{
|
||||
while (nnzPerCol >= 4) {
|
||||
std::cout << "nnz: " << nnzPerCol << "\n";
|
||||
sm.setZero();
|
||||
fillMatrix2(nnzPerCol, rows, cols, sm);
|
||||
|
||||
// dense matrices
|
||||
#ifdef DENSEMATRIX
|
||||
// dense matrices
|
||||
#ifdef DENSEMATRIX
|
||||
{
|
||||
DenseMatrix dm(rows,cols), (rows,cols);
|
||||
DenseMatrix dm(rows, cols), (rows, cols);
|
||||
eiToDense(sm, dm);
|
||||
|
||||
SPMV_BENCH(res = dm * sm);
|
||||
std::cout << "Dense " << t.value()/repeats << "\t";
|
||||
std::cout << "Dense " << t.value() / repeats << "\t";
|
||||
|
||||
SPMV_BENCH(res = dm.transpose() * sm);
|
||||
std::cout << t.value()/repeats << endl;
|
||||
std::cout << t.value() / repeats << endl;
|
||||
}
|
||||
#endif
|
||||
#endif
|
||||
|
||||
// eigen sparse matrices
|
||||
{
|
||||
SPMV_BENCH(res.noalias() += sm * dv; )
|
||||
std::cout << "Eigen " << t.value()/repeats << "\t";
|
||||
SPMV_BENCH(res.noalias() += sm * dv;)
|
||||
std::cout << "Eigen " << t.value() / repeats << "\t";
|
||||
|
||||
SPMV_BENCH(res.noalias() += sm.transpose() * dv; )
|
||||
std::cout << t.value()/repeats << endl;
|
||||
SPMV_BENCH(res.noalias() += sm.transpose() * dv;)
|
||||
std::cout << t.value() / repeats << endl;
|
||||
}
|
||||
|
||||
// CSparse
|
||||
#ifdef CSPARSE
|
||||
// CSparse
|
||||
#ifdef CSPARSE
|
||||
{
|
||||
std::cout << "CSparse \n";
|
||||
cs *csm;
|
||||
eiToCSparse(sm, csm);
|
||||
|
||||
// BENCH();
|
||||
// timer.stop();
|
||||
// std::cout << " a * b:\t" << timer.value() << endl;
|
||||
// BENCH();
|
||||
// timer.stop();
|
||||
// std::cout << " a * b:\t" << timer.value() << endl;
|
||||
|
||||
// BENCH( { m3 = cs_sorted_multiply2(m1, m2); cs_spfree(m3); } );
|
||||
// std::cout << " a * b:\t" << timer.value() << endl;
|
||||
// BENCH( { m3 = cs_sorted_multiply2(m1, m2); cs_spfree(m3); } );
|
||||
// std::cout << " a * b:\t" << timer.value() << endl;
|
||||
}
|
||||
#endif
|
||||
#endif
|
||||
|
||||
#ifdef OSKI
|
||||
#ifdef OSKI
|
||||
{
|
||||
oski_matrix_t om;
|
||||
oski_vecview_t ov, ores;
|
||||
oski_Init();
|
||||
om = oski_CreateMatCSC(sm._outerIndexPtr(), sm._innerIndexPtr(), sm._valuePtr(), rows, cols,
|
||||
SHARE_INPUTMAT, 1, INDEX_ZERO_BASED);
|
||||
om = oski_CreateMatCSC(sm._outerIndexPtr(), sm._innerIndexPtr(), sm._valuePtr(), rows, cols, SHARE_INPUTMAT, 1,
|
||||
INDEX_ZERO_BASED);
|
||||
ov = oski_CreateVecView(dv.data(), cols, STRIDE_UNIT);
|
||||
ores = oski_CreateVecView(res.data(), rows, STRIDE_UNIT);
|
||||
|
||||
SPMV_BENCH( oski_MatMult(om, OP_NORMAL, 1, ov, 0, ores) );
|
||||
std::cout << "OSKI " << t.value()/repeats << "\t";
|
||||
SPMV_BENCH(oski_MatMult(om, OP_NORMAL, 1, ov, 0, ores));
|
||||
std::cout << "OSKI " << t.value() / repeats << "\t";
|
||||
|
||||
SPMV_BENCH( oski_MatMult(om, OP_TRANS, 1, ov, 0, ores) );
|
||||
std::cout << t.value()/repeats << "\n";
|
||||
SPMV_BENCH(oski_MatMult(om, OP_TRANS, 1, ov, 0, ores));
|
||||
std::cout << t.value() / repeats << "\n";
|
||||
|
||||
// tune
|
||||
t.reset();
|
||||
@@ -153,81 +141,76 @@ int main(int argc, char *argv[])
|
||||
t.stop();
|
||||
double tuning = t.value();
|
||||
|
||||
SPMV_BENCH( oski_MatMult(om, OP_NORMAL, 1, ov, 0, ores) );
|
||||
std::cout << "OSKI tuned " << t.value()/repeats << "\t";
|
||||
|
||||
SPMV_BENCH( oski_MatMult(om, OP_TRANS, 1, ov, 0, ores) );
|
||||
std::cout << t.value()/repeats << "\t(" << tuning << ")\n";
|
||||
SPMV_BENCH(oski_MatMult(om, OP_NORMAL, 1, ov, 0, ores));
|
||||
std::cout << "OSKI tuned " << t.value() / repeats << "\t";
|
||||
|
||||
SPMV_BENCH(oski_MatMult(om, OP_TRANS, 1, ov, 0, ores));
|
||||
std::cout << t.value() / repeats << "\t(" << tuning << ")\n";
|
||||
|
||||
oski_DestroyMat(om);
|
||||
oski_DestroyVecView(ov);
|
||||
oski_DestroyVecView(ores);
|
||||
oski_Close();
|
||||
}
|
||||
#endif
|
||||
#endif
|
||||
|
||||
#ifndef NOUBLAS
|
||||
#ifndef NOUBLAS
|
||||
{
|
||||
using namespace boost::numeric;
|
||||
UblasMatrix um(rows,cols);
|
||||
UblasMatrix um(rows, cols);
|
||||
eiToUblas(sm, um);
|
||||
|
||||
boost::numeric::ublas::vector<Scalar> uv(cols), ures(rows);
|
||||
Map<Matrix<Scalar,Dynamic,1> >(&uv[0], cols) = dv;
|
||||
Map<Matrix<Scalar,Dynamic,1> >(&ures[0], rows) = res;
|
||||
Map<Matrix<Scalar, Dynamic, 1> >(&uv[0], cols) = dv;
|
||||
Map<Matrix<Scalar, Dynamic, 1> >(&ures[0], rows) = res;
|
||||
|
||||
SPMV_BENCH(ublas::axpy_prod(um, uv, ures, true));
|
||||
std::cout << "ublas " << t.value()/repeats << "\t";
|
||||
std::cout << "ublas " << t.value() / repeats << "\t";
|
||||
|
||||
SPMV_BENCH(ublas::axpy_prod(boost::numeric::ublas::trans(um), uv, ures, true));
|
||||
std::cout << t.value()/repeats << endl;
|
||||
std::cout << t.value() / repeats << endl;
|
||||
}
|
||||
#endif
|
||||
#endif
|
||||
|
||||
// GMM++
|
||||
#ifndef NOGMM
|
||||
// GMM++
|
||||
#ifndef NOGMM
|
||||
{
|
||||
GmmSparse gm(rows,cols);
|
||||
GmmSparse gm(rows, cols);
|
||||
eiToGmm(sm, gm);
|
||||
|
||||
std::vector<Scalar> gv(cols), gres(rows);
|
||||
Map<Matrix<Scalar,Dynamic,1> >(&gv[0], cols) = dv;
|
||||
Map<Matrix<Scalar,Dynamic,1> >(&gres[0], rows) = res;
|
||||
Map<Matrix<Scalar, Dynamic, 1> >(&gv[0], cols) = dv;
|
||||
Map<Matrix<Scalar, Dynamic, 1> >(&gres[0], rows) = res;
|
||||
|
||||
SPMV_BENCH(gmm::mult(gm, gv, gres));
|
||||
std::cout << "GMM++ " << t.value()/repeats << "\t";
|
||||
std::cout << "GMM++ " << t.value() / repeats << "\t";
|
||||
|
||||
SPMV_BENCH(gmm::mult(gmm::transposed(gm), gv, gres));
|
||||
std::cout << t.value()/repeats << endl;
|
||||
std::cout << t.value() / repeats << endl;
|
||||
}
|
||||
#endif
|
||||
#endif
|
||||
|
||||
// MTL4
|
||||
#ifndef NOMTL
|
||||
// MTL4
|
||||
#ifndef NOMTL
|
||||
{
|
||||
MtlSparse mm(rows,cols);
|
||||
MtlSparse mm(rows, cols);
|
||||
eiToMtl(sm, mm);
|
||||
mtl::dense_vector<Scalar> mv(cols, 1.0);
|
||||
mtl::dense_vector<Scalar> mres(rows, 1.0);
|
||||
|
||||
SPMV_BENCH(mres = mm * mv);
|
||||
std::cout << "MTL4 " << t.value()/repeats << "\t";
|
||||
std::cout << "MTL4 " << t.value() / repeats << "\t";
|
||||
|
||||
SPMV_BENCH(mres = trans(mm) * mv);
|
||||
std::cout << t.value()/repeats << endl;
|
||||
std::cout << t.value() / repeats << endl;
|
||||
}
|
||||
#endif
|
||||
#endif
|
||||
|
||||
std::cout << "\n";
|
||||
|
||||
if(nnzPerCol==1)
|
||||
break;
|
||||
nnzPerCol -= nnzPerCol/2;
|
||||
if (nnzPerCol == 1) break;
|
||||
nnzPerCol -= nnzPerCol / 2;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
Reference in New Issue
Block a user