lazy_gemm.cpp 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101
  1. #include <iostream>
  2. #include <fstream>
  3. #include <vector>
  4. #include <Eigen/Core>
  5. #include "../../BenchTimer.h"
  6. using namespace Eigen;
  7. #ifndef SCALAR
  8. #error SCALAR must be defined
  9. #endif
  10. typedef SCALAR Scalar;
  11. template<typename MatA, typename MatB, typename MatC>
  12. EIGEN_DONT_INLINE
  13. void lazy_gemm(const MatA &A, const MatB &B, MatC &C)
  14. {
  15. // escape((void*)A.data());
  16. // escape((void*)B.data());
  17. C.noalias() += A.lazyProduct(B);
  18. // escape((void*)C.data());
  19. }
  20. template<int m, int n, int k, int TA>
  21. EIGEN_DONT_INLINE
  22. double bench()
  23. {
  24. typedef Matrix<Scalar,m,k,TA> MatA;
  25. typedef Matrix<Scalar,k,n> MatB;
  26. typedef Matrix<Scalar,m,n> MatC;
  27. MatA A(m,k);
  28. MatB B(k,n);
  29. MatC C(m,n);
  30. A.setRandom();
  31. B.setRandom();
  32. C.setZero();
  33. BenchTimer t;
  34. double up = 1e7*4/sizeof(Scalar);
  35. double tm0 = 10, tm1 = 20;
  36. double flops = 2. * m * n * k;
  37. long rep = std::max(10., std::min(10000., up/flops) );
  38. long tries = std::max(tm0, std::min(tm1, up/flops) );
  39. BENCH(t, tries, rep, lazy_gemm(A,B,C));
  40. return 1e-9 * rep * flops / t.best();
  41. }
  42. template<int m, int n, int k>
  43. double bench_t(int t)
  44. {
  45. if(t)
  46. return bench<m,n,k,RowMajor>();
  47. else
  48. return bench<m,n,k,0>();
  49. }
  50. EIGEN_DONT_INLINE
  51. double bench_mnk(int m, int n, int k, int t)
  52. {
  53. int id = m*10000 + n*100 + k;
  54. switch(id) {
  55. case 10101 : return bench_t< 1, 1, 1>(t); break;
  56. case 20202 : return bench_t< 2, 2, 2>(t); break;
  57. case 30303 : return bench_t< 3, 3, 3>(t); break;
  58. case 40404 : return bench_t< 4, 4, 4>(t); break;
  59. case 50505 : return bench_t< 5, 5, 5>(t); break;
  60. case 60606 : return bench_t< 6, 6, 6>(t); break;
  61. case 70707 : return bench_t< 7, 7, 7>(t); break;
  62. case 80808 : return bench_t< 8, 8, 8>(t); break;
  63. case 90909 : return bench_t< 9, 9, 9>(t); break;
  64. case 101010 : return bench_t<10,10,10>(t); break;
  65. case 111111 : return bench_t<11,11,11>(t); break;
  66. case 121212 : return bench_t<12,12,12>(t); break;
  67. }
  68. return 0;
  69. }
  70. int main(int argc, char **argv)
  71. {
  72. std::vector<double> results;
  73. std::string filename = std::string("lazy_gemm_settings.txt");
  74. if(argc>1)
  75. filename = std::string(argv[1]);
  76. std::ifstream settings(filename);
  77. long m, n, k, t;
  78. while(settings >> m >> n >> k >> t)
  79. {
  80. //std::cerr << " Testing " << m << " " << n << " " << k << std::endl;
  81. results.push_back( bench_mnk(m, n, k, t) );
  82. }
  83. std::cout << RowVectorXd::Map(results.data(), results.size());
  84. return 0;
  85. }