You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

matrix_mul.cpp 23 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612
  1. /**
  2. * \file dnn/test/aarch64/matrix_mul.cpp
  3. * MegEngine is Licensed under the Apache License, Version 2.0 (the "License")
  4. *
  5. * Copyright (c) 2014-2020 Megvii Inc. All rights reserved.
  6. *
  7. * Unless required by applicable law or agreed to in writing,
  8. * software distributed under the License is distributed on an
  9. * "AS IS" BASIS, WITHOUT ARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  10. */
  11. #include "test/aarch64/fixture.h"
  12. #include "test/common/benchmarker.h"
  13. #include "test/common/checker.h"
  14. #include "test/common/matrix_mul.h"
  15. #include "test/common/rng.h"
  16. using namespace megdnn;
  17. using namespace test;
  18. TEST_F(AARCH64, MATRIX_MUL_FP32K8X12) {
  19. matrix_mul::check_matrix_mul(dtype::Float32{}, dtype::Float32{},
  20. dtype::Float32{}, handle(),
  21. "AARCH64_F32K8X12X1");
  22. }
  23. TEST_F(AARCH64, MATRIX_MUL_FP32K4X16) {
  24. matrix_mul::check_matrix_mul(dtype::Float32{}, dtype::Float32{},
  25. dtype::Float32{}, handle(),
  26. "AARCH64_F32K4X16X1");
  27. }
  28. TEST_F(AARCH64, MATRIX_MUL_FP32_MK4) {
  29. //! nbase should be 4 in order to test the last rest 4 in N dim
  30. matrix_mul::check_matrix_mul(
  31. dtype::Float32{}, dtype::Float32{}, dtype::Float32{}, handle(),
  32. "AARCH64_F32_MK4_4x16", param::MatrixMul::Format::MK4, 4);
  33. }
  34. #if __ARM_FEATURE_FP16_VECTOR_ARITHMETIC
  35. TEST_F(AARCH64, MATRIX_MUL_F16_K8X24X1) {
  36. matrix_mul::check_matrix_mul(dtype::Float16{}, dtype::Float16{},
  37. dtype::Float16{}, handle(),
  38. "AARCH64_F16_K8X24X1");
  39. }
  40. TEST_F(AARCH64, MATRIX_MUL_F16_MK8) {
  41. //! nbase should be 4 in order to test the last rest 4 in N dim
  42. matrix_mul::check_matrix_mul(
  43. dtype::Float16{}, dtype::Float16{}, dtype::Float16{}, handle(),
  44. "AARCH64_F16_MK8_8X8", param::MatrixMul::Format::MK8, 4);
  45. }
  46. #endif
  47. #if __ARM_FEATURE_DOTPROD
  48. TEST_F(AARCH64, MATRIX_MUL_INT8X8X32_K8X12X4_DOTPROD) {
  49. matrix_mul::check_matrix_mul(dtype::Int8{}, dtype::Int8{}, dtype::Int32{},
  50. handle(), "AARCH64_INT8X8X32_K8X12X4_DOTPROD");
  51. }
  52. #else
  53. TEST_F(AARCH64, MATRIX_MUL_INT8X8X32_K4X4X16) {
  54. matrix_mul::check_matrix_mul(dtype::Int8{}, dtype::Int8{}, dtype::Int32{},
  55. handle(), "AARCH64_INT8X8X32_K4X4X16");
  56. }
  57. TEST_F(AARCH64, MATRIX_MUL_INT8_MK4) {
  58. std::vector<matrix_mul::TestArg> args;
  59. for (size_t m : {1, 2, 3, 4, 5, 7, 10, 11})
  60. for (size_t n : {1, 2, 3, 4, 5, 8, 16, 24, 25, 32})
  61. for (size_t k : {1, 2, 3, 4, 5, 6, 7, 8, 16, 32, 33, 34})
  62. args.emplace_back(m, n, k, 0);
  63. matrix_mul::check_matrix_mul(dtype::Int8{}, dtype::Int8{}, dtype::Int32{},
  64. handle(), "AARCH64_INT8X8X32_MK4_4X4X16",
  65. param::MatrixMul::Format::MK4, 1, 1e-3,
  66. std::move(args));
  67. }
  68. TEST_F(AARCH64, MATRIX_MUL_INT8x8x32_K8x8x8) {
  69. matrix_mul::check_matrix_mul(dtype::Int8{}, dtype::Int8{}, dtype::Int32{},
  70. handle(), "AARCH64_INT8X8X32_K8X8X8");
  71. }
  72. #endif
  73. TEST_F(AARCH64, MATRIX_MUL_INT8x8x16_K8x8x8) {
  74. matrix_mul::check_matrix_mul(dtype::Int8{}, dtype::Int8{}, dtype::Int16{},
  75. handle(), "AARCH64_INT8X8X16_K8X8X8");
  76. }
  77. TEST_F(AARCH64, MATRIX_MUL_INT8x8x16_K4x4x16) {
  78. matrix_mul::check_matrix_mul(dtype::Int8{}, dtype::Int8{}, dtype::Int16{},
  79. handle(), "AARCH64_INT8X8X16_K4X4X16");
  80. }
  81. TEST_F(AARCH64, MATRIX_MUL_INT16x16x32_K12X8X1) {
  82. matrix_mul::check_matrix_mul(dtype::Int16{}, dtype::Int16{}, dtype::Int32{},
  83. handle(), "AARCH64_INT16X16X32_K12X8X1");
  84. }
  85. TEST_F(AARCH64, MATRIX_MUL_INT16x16x32_MK8) {
  86. //! nbase should be 4 in order to test the last rest 4 in N dim
  87. matrix_mul::check_matrix_mul(dtype::Int16{}, dtype::Int16{}, dtype::Int32{},
  88. handle(), "AARCH64_INT16X16X32_MK8_8X8",
  89. param::MatrixMul::Format::MK8, 4);
  90. }
  91. //! FIXME: need to add tests of GEMV and QUINT8
  92. #if MEGDNN_WITH_BENCHMARK
  93. TEST_F(AARCH64, BENCHMARK_MATRIX_MUL_FP32_K4X16) {
  94. constexpr size_t RUNS = 50;
  95. param::MatrixMul param;
  96. param.transposeA = false;
  97. param.transposeB = false;
  98. Benchmarker<MatrixMul> benchmarker_K4X16(handle());
  99. Benchmarker<MatrixMul> benchmarker_K12X8(handle());
  100. benchmarker_K4X16.set_times(RUNS)
  101. .set_dtype(0, dtype::Float32{})
  102. .set_dtype(1, dtype::Float32{})
  103. .set_dtype(2, dtype::Float32{})
  104. .set_param(param)
  105. .set_display(false);
  106. benchmarker_K4X16.set_before_exec_callback(
  107. AlgoChecker<MatrixMul>("AARCH64_F32K4X16X1"));
  108. benchmarker_K12X8.set_before_exec_callback(
  109. AlgoChecker<MatrixMul>("AARCH64_F32K8X12X1"));
  110. benchmarker_K12X8.set_times(RUNS)
  111. .set_dtype(0, dtype::Float32{})
  112. .set_dtype(1, dtype::Float32{})
  113. .set_dtype(2, dtype::Float32{})
  114. .set_param(param)
  115. .set_display(false);
  116. auto run = [&](size_t M, size_t N, size_t K) {
  117. TensorShape A, B;
  118. if (param.transposeA) {
  119. A = TensorShape{K, M};
  120. } else {
  121. A = TensorShape{M, K};
  122. }
  123. if (param.transposeB) {
  124. B = TensorShape{N, K};
  125. } else {
  126. B = TensorShape{K, N};
  127. }
  128. auto k4x16_used = benchmarker_K4X16.exec({A, B, {}}) / RUNS;
  129. auto k12x8_used = benchmarker_K12X8.exec({A, B, {}}) / RUNS;
  130. float computations = 2.f * M * K * N * 1e-6;
  131. printf("run: {%zu{M} %zu{K} %zu{N}} k4x16: %f ms %f Gflops k12x8: %f "
  132. "ms "
  133. "%f Gflops k4x16_vs_k12x8: %f\n",
  134. M, K, N, k4x16_used, computations / k4x16_used, k12x8_used,
  135. computations / k12x8_used, k12x8_used / k4x16_used);
  136. };
  137. run(256, 256, 128);
  138. for (size_t k = 4; k <= 256; k *= 8) {
  139. for (size_t m = 4; m <= 256; m *= 4) {
  140. for (size_t n = 4; n <= 256; n *= 4) {
  141. run(m, n, k);
  142. }
  143. printf("\n");
  144. }
  145. printf("\n");
  146. }
  147. }
  148. TEST_F(AARCH64, BENCHMARK_MATRIX_MUL_INT16_8X8X8) {
  149. constexpr size_t RUNS = 50;
  150. param::MatrixMul param;
  151. param.transposeA = false;
  152. param.transposeB = false;
  153. Benchmarker<MatrixMul> benchmarker_int(handle());
  154. Benchmarker<MatrixMul> benchmarker_int32(handle());
  155. benchmarker_int.set_times(RUNS)
  156. .set_dtype(0, dtype::Int8{})
  157. .set_dtype(1, dtype::Int8{})
  158. .set_dtype(2, dtype::Int16{})
  159. .set_param(param)
  160. .set_display(false);
  161. benchmarker_int.set_before_exec_callback(
  162. AlgoChecker<MatrixMul>("AARCH64_INT8X8X16_K8X8X8"));
  163. benchmarker_int32.set_before_exec_callback(
  164. AlgoChecker<MatrixMul>("AARCH64_INT8X8X32_K8X8X8"));
  165. benchmarker_int32.set_times(RUNS)
  166. .set_dtype(0, dtype::Int8{})
  167. .set_dtype(1, dtype::Int8{})
  168. .set_dtype(2, dtype::Int32{})
  169. .set_param(param)
  170. .set_display(false);
  171. Benchmarker<MatrixMul> benchmarker_float(handle());
  172. benchmarker_float.set_param(param).set_display(false).set_times(RUNS);
  173. auto run = [&](size_t M, size_t N, size_t K) {
  174. TensorShape A, B;
  175. if (param.transposeA) {
  176. A = TensorShape{K, M};
  177. } else {
  178. A = TensorShape{M, K};
  179. }
  180. if (param.transposeB) {
  181. B = TensorShape{N, K};
  182. } else {
  183. B = TensorShape{K, N};
  184. }
  185. auto int_used = benchmarker_int.exec({A, B, {}}) / RUNS;
  186. auto float_used = benchmarker_float.exec({A, B, {}}) / RUNS;
  187. auto int32_used = benchmarker_int32.exec({A, B, {}}) / RUNS;
  188. float computations = 2.f * M * K * N * 1e-6;
  189. printf("run: {%zu{M} %zu{K} %zu{N}} float: %f ms %f Gflops int: %f ms "
  190. "%f Gflops speedup_vs_fp32: %f, speedup_vs_int32: %f\n",
  191. M, K, N, float_used, computations / float_used, int_used,
  192. computations / int_used, float_used / int_used,
  193. int32_used / int_used);
  194. };
  195. run(256, 256, 128);
  196. for (size_t k = 4; k <= 256; k *= 8) {
  197. for (size_t m = 4; m <= 256; m *= 4) {
  198. for (size_t n = 4; n <= 256; n *= 4) {
  199. run(m, n, k);
  200. }
  201. std::cout << std::endl;
  202. }
  203. std::cout << std::endl;
  204. }
  205. }
  206. TEST_F(AARCH64, BENCHMARK_MATRIX_MUL_INT32_MK_4X4X16) {
  207. constexpr size_t RUNS = 50;
  208. param::MatrixMul param;
  209. param.transposeA = false;
  210. param.transposeB = false;
  211. Benchmarker<MatrixMul> benchmarker(handle());
  212. Benchmarker<MatrixMul> benchmarker_mk4(handle());
  213. benchmarker.set_times(RUNS)
  214. .set_dtype(0, dtype::Int8{})
  215. .set_dtype(1, dtype::Int8{})
  216. .set_dtype(2, dtype::Int32{})
  217. .set_param(param)
  218. .set_display(false);
  219. benchmarker.set_before_exec_callback(
  220. AlgoChecker<MatrixMul>("AARCH64_INT8X8X32_K4X4X16"));
  221. param.format = MatrixMul::Param::Format::MK4;
  222. benchmarker_mk4.set_before_exec_callback(
  223. AlgoChecker<MatrixMul>("AARCH64_INT8X8X32_MK4_4X4X16"));
  224. benchmarker_mk4.set_times(RUNS)
  225. .set_dtype(0, dtype::Int8{})
  226. .set_dtype(1, dtype::Int8{})
  227. .set_dtype(2, dtype::Int32{})
  228. .set_param(param)
  229. .set_display(false);
  230. auto run = [&](size_t M, size_t N, size_t K) {
  231. auto default_used = benchmarker.exec({{M, K}, {K, N}, {}}) / RUNS;
  232. auto mk_used = benchmarker_mk4.exec(
  233. {{M / 4, K / 4, 4, 4}, {K / 4, N, 4}, {}}) /
  234. RUNS;
  235. float computations = 2.f * M * K * N * 1e-6;
  236. printf("run: {%zu{M} %zu{K} %zu{N}} normal: %f ms %f Gflops mk4: %f ms "
  237. "%f Gflops speedup_vs_normal: %f\n",
  238. M, K, N, default_used, computations / default_used, mk_used,
  239. computations / mk_used, default_used / mk_used);
  240. };
  241. run(256, 256, 128);
  242. for (size_t k = 4; k <= 512; k *= 2) {
  243. for (size_t m = 4; m <= 512; m *= 2) {
  244. for (size_t n = 4; n <= 512; n *= 2) {
  245. run(m, n, k);
  246. }
  247. }
  248. std::cout << std::endl;
  249. }
  250. }
  251. TEST_F(AARCH64, BENCHMARK_MATRIX_MUL_INT16_4X4X16) {
  252. constexpr size_t RUNS = 50;
  253. param::MatrixMul param;
  254. param.transposeA = false;
  255. param.transposeB = false;
  256. Benchmarker<MatrixMul> benchmarker_int(handle());
  257. Benchmarker<MatrixMul> benchmarker_int32(handle());
  258. benchmarker_int.set_times(RUNS)
  259. .set_dtype(0, dtype::Int8{})
  260. .set_dtype(1, dtype::Int8{})
  261. .set_dtype(2, dtype::Int16{})
  262. .set_param(param)
  263. .set_display(false);
  264. benchmarker_int.set_before_exec_callback(
  265. AlgoChecker<MatrixMul>("AARCH64_INT8X8X16_K4X4X16"));
  266. benchmarker_int32.set_before_exec_callback(
  267. AlgoChecker<MatrixMul>("AARCH64_INT8X8X32_K4X4X16"));
  268. benchmarker_int32.set_times(RUNS)
  269. .set_dtype(0, dtype::Int8{})
  270. .set_dtype(1, dtype::Int8{})
  271. .set_dtype(2, dtype::Int32{})
  272. .set_param(param)
  273. .set_display(false);
  274. Benchmarker<MatrixMul> benchmarker_float(handle());
  275. benchmarker_float.set_param(param).set_display(false).set_times(RUNS);
  276. auto run = [&](size_t M, size_t N, size_t K) {
  277. TensorShape A, B;
  278. if (param.transposeA) {
  279. A = TensorShape{K, M};
  280. } else {
  281. A = TensorShape{M, K};
  282. }
  283. if (param.transposeB) {
  284. B = TensorShape{N, K};
  285. } else {
  286. B = TensorShape{K, N};
  287. }
  288. auto int_used = benchmarker_int.exec({A, B, {}}) / RUNS;
  289. auto float_used = benchmarker_float.exec({A, B, {}}) / RUNS;
  290. auto int32_used = benchmarker_int32.exec({A, B, {}}) / RUNS;
  291. float computations = 2.f * M * K * N * 1e-6;
  292. printf("run: {%zu{M} %zu{K} %zu{N}} float: %f ms %f Gflops int: %f ms "
  293. "%f Gflops speedup_vs_fp32: %f, speedup_vs_int32: %f\n",
  294. M, K, N, float_used, computations / float_used, int_used,
  295. computations / int_used, float_used / int_used,
  296. int32_used / int_used);
  297. };
  298. run(256, 256, 128);
  299. for (size_t k = 4; k <= 16; k *= 2) {
  300. for (size_t m = 4; m <= 64; m *= 2) {
  301. for (size_t n = 4; n <= 64; n *= 2) {
  302. run(m, n, k);
  303. }
  304. }
  305. std::cout << std::endl;
  306. }
  307. }
  308. TEST_F(AARCH64, BENCHMARK_GEMV) {
  309. int exec_times = 10;
  310. Benchmarker<MatrixMul> benchmarker_gemm(handle());
  311. benchmarker_gemm.set_times(exec_times);
  312. float mod = 1000 * exec_times / 1e9;
  313. auto run = [&](size_t M, size_t K, size_t N) {
  314. float time = 1.f, perf = 1.f;
  315. std::cout << "GEMM: (" << M << ", " << K << ", " << N << ")"
  316. << std::endl;
  317. benchmarker_gemm.set_dtype(0, dtype::Float32())
  318. .set_dtype(1, dtype::Float32());
  319. time = benchmarker_gemm.exec({{M, K}, {K, N}, {}});
  320. perf = 2.f * M * K * N / time * mod;
  321. std::cout << "gemm fp32, Performance is " << perf << " Gflops"
  322. << std::endl;
  323. #if __ARM_FEATURE_FP16_VECTOR_ARITHMETIC
  324. benchmarker_gemm.set_dtype(0, dtype::Float16())
  325. .set_dtype(1, dtype::Float16());
  326. time = benchmarker_gemm.exec({{M, K}, {K, N}, {}});
  327. perf = 2.f * M * K * N / time * mod;
  328. std::cout << "gemm fp16, Performance is " << perf << " Gflops"
  329. << std::endl;
  330. #endif
  331. };
  332. std::cout << "warm up:\n";
  333. for (int i = 0; i < 50; i++) {
  334. benchmarker_gemm.set_dtype(0, dtype::Float32())
  335. .set_dtype(1, dtype::Float32())
  336. .set_display(false)
  337. .exec({{256, 256}, {256, 256}, {}});
  338. benchmarker_gemm.set_display(true);
  339. }
  340. // run gemv
  341. for (size_t M : {1, 2, 3, 4, 5, 6, 7, 8, 64, 256})
  342. for (size_t K : {1, 2, 3, 4, 5, 6, 7, 8, 64, 256})
  343. for (size_t N : {112})
  344. run(M, K, N);
  345. }
  346. #if __ARM_FEATURE_DOTPROD
  347. TEST_F(AARCH64, BENCHMARK_TRANSPOSED_MATRIX_MUL_INT_8X8X32) {
  348. constexpr size_t RUNS = 50;
  349. param::MatrixMul param;
  350. param.transposeA = param.transposeB = true;
  351. Benchmarker<MatrixMul> benchmarker_int(handle());
  352. benchmarker_int.set_times(RUNS)
  353. .set_dtype(0, dtype::Int8{})
  354. .set_dtype(1, dtype::Int8{})
  355. .set_dtype(2, {})
  356. .set_param(param)
  357. .set_display(false);
  358. Benchmarker<MatrixMul> benchmarker_float(handle());
  359. benchmarker_float.set_param(param).set_display(false).set_times(RUNS);
  360. auto run = [&](size_t M, size_t N, size_t K) {
  361. auto int_used = benchmarker_int.exec({{K, M}, {N, K}, {}}) / RUNS;
  362. auto float_used = benchmarker_float.exec({{K, M}, {N, K}, {}}) / RUNS;
  363. float computations = 2.f * M * K * N * 1e-6;
  364. printf("run: {%zu{M} %zu{K} %zu{N}} float: %f ms %f Gflops int: %f ms "
  365. "%f Gflops speedup: %f\n",
  366. M, K, N, float_used, computations / float_used, int_used,
  367. computations / int_used, float_used / int_used);
  368. };
  369. run(256, 12 * 24, 256);
  370. for (size_t M : {8, 64, 112, 256}) {
  371. for (size_t K : {8, 64, 112, 256}) {
  372. for (size_t N : {8, 64, 112, 256}) {
  373. run(M, N, K);
  374. }
  375. }
  376. }
  377. }
  378. TEST_F(AARCH64, BENCHMARK_GEMV_INT_8X8X32) {
  379. constexpr size_t RUNS = 50;
  380. param::MatrixMul param;
  381. Benchmarker<MatrixMul> benchmarker_int(handle());
  382. benchmarker_int.set_times(RUNS)
  383. .set_dtype(0, dtype::Int8{})
  384. .set_dtype(1, dtype::Int8{})
  385. .set_dtype(2, {})
  386. .set_param(param)
  387. .set_display(false);
  388. Benchmarker<MatrixMul> benchmarker_float(handle());
  389. benchmarker_float.set_display(false).set_times(RUNS);
  390. auto run = [&](size_t M, size_t N, size_t K) {
  391. auto int_used = benchmarker_int.exec({{M, K}, {K, N}, {}}) / RUNS;
  392. auto float_used = benchmarker_float.exec({{M, K}, {K, N}, {}}) / RUNS;
  393. float computations = 2.f * M * K * N * 1e-6;
  394. printf("run: {%zu{M} %zu{K} %zu{N}} float: %f ms %f Gflops int: %f ms "
  395. "%f Gflops speedup: %f\n",
  396. M, K, N, float_used, computations / float_used, int_used,
  397. computations / int_used, float_used / int_used);
  398. };
  399. for (size_t M : {1, 2, 3, 4, 5, 6, 7, 8, 16, 32, 64, 256})
  400. for (size_t N : {1, 2, 3, 4, 5, 6, 7, 8, 16, 32, 64, 256})
  401. for (size_t K : {1, 2, 3, 4, 5, 6, 7, 8, 16, 32, 64, 256})
  402. run(M, N, K);
  403. }
  404. #endif // __ARM_FEATURE_DOTPROD
  405. #if __ARM_FEATURE_FP16_VECTOR_ARITHMETIC
  406. TEST_F(AARCH64, BENCHMARK_MATRIX_MUL_F16_MK8) {
  407. auto args = matrix_mul::get_benchmark_matmul_mk_packed_args(8);
  408. matrix_mul::benchmark_with_contrast(
  409. handle(), args, dtype::Float16{}, dtype::Float16{},
  410. dtype::Float16{}, "AARCH64_F16_MK8_8X8",
  411. param::MatrixMul::Format::MK8, dtype::Float16{}, dtype::Float16{},
  412. dtype::Float16{}, "AARCH64_F16_K8X24X1");
  413. }
  414. #endif
  415. TEST_F(AARCH64, BENCHMARK_MATRIX_MUL_INT16x16x32) {
  416. constexpr size_t RUNS = 50;
  417. Benchmarker<MatrixMul> benchmarker_int(handle());
  418. benchmarker_int.set_times(RUNS)
  419. .set_dtype(0, dtype::Int16{})
  420. .set_dtype(1, dtype::Int16{})
  421. .set_dtype(2, dtype::Int32{})
  422. .set_display(false);
  423. Benchmarker<MatrixMul> benchmarker_float(handle());
  424. benchmarker_float.set_display(false).set_times(RUNS);
  425. auto run = [&](size_t M, size_t N, size_t K, int mask) {
  426. param::MatrixMul param;
  427. param.transposeA = mask & 0x1;
  428. param.transposeB = mask & 0x2;
  429. benchmarker_int.set_param(param);
  430. benchmarker_float.set_param(param);
  431. TensorShape A, B;
  432. if (param.transposeA) {
  433. A = TensorShape{K, M};
  434. } else {
  435. A = TensorShape{M, K};
  436. }
  437. if (param.transposeB) {
  438. B = TensorShape{N, K};
  439. } else {
  440. B = TensorShape{K, N};
  441. }
  442. auto int_used = benchmarker_int.exec({A, B, {}}) / RUNS;
  443. auto float_used = benchmarker_float.exec({A, B, {}}) / RUNS;
  444. float computations = 2.f * M * K * N * 1e-6;
  445. printf("run: {%zu{M} %zu{K} %zu{N} %d{TA} %d{TB}} "
  446. "float: %f ms %f Gflops int: %f ms "
  447. "%f Gflops speedup: %f\n",
  448. M, K, N, param.transposeA, param.transposeB, float_used,
  449. computations / float_used, int_used, computations / int_used,
  450. float_used / int_used);
  451. };
  452. constexpr int mask = 4;
  453. for (auto i = 0; i < mask; i++) {
  454. for (size_t M : {8, 64, 112, 256}) {
  455. for (size_t K : {8, 64, 112, 256}) {
  456. for (size_t N : {8, 64, 112, 256}) {
  457. run(M, N, K, i);
  458. }
  459. }
  460. }
  461. }
  462. }
  463. TEST_F(AARCH64, BENCHMARK_MATRIX_MUL_FP32_MK4) {
  464. auto args = matrix_mul::get_benchmark_matmul_mk_packed_args(16);
  465. matrix_mul::benchmark_with_contrast(
  466. handle(), args, dtype::Float32{}, dtype::Float32{},
  467. dtype::Float32{}, "AARCH64_F32_MK4_4x16",
  468. param::MatrixMul::Format::MK4, dtype::Float32{}, dtype::Float32{},
  469. dtype::Float32{});
  470. }
  471. TEST_F(AARCH64, BENCHMARK_MATRIX_MUL_INT16x16x32_MK8) {
  472. auto args = matrix_mul::get_benchmark_matmul_mk_packed_args(8);
  473. matrix_mul::benchmark_with_contrast(
  474. handle(), args, dtype::Int16{}, dtype::Int16{}, dtype::Int32{},
  475. "AARCH64_INT16X16X32_MK8_8X8", param::MatrixMul::Format::MK8,
  476. dtype::Int16{}, dtype::Int16{}, dtype::Int32{});
  477. }
  478. TEST_F(AARCH64, BENCHMARK_MATRIX_MUL_FP32_K8X12) {
  479. constexpr size_t RUNS = 50;
  480. param::MatrixMul param;
  481. param.transposeA = param.transposeB = true;
  482. Benchmarker<MatrixMul> benchmarker_k12x8(handle());
  483. Benchmarker<MatrixMul> benchmarker_k8x12(handle());
  484. benchmarker_k12x8.set_param(param).set_display(false).set_times(RUNS);
  485. benchmarker_k8x12.set_param(param).set_display(false).set_times(RUNS);
  486. benchmarker_k12x8.set_before_exec_callback(
  487. AlgoChecker<MatrixMul>("AARCH64_F32K4X16X1"));
  488. benchmarker_k8x12.set_before_exec_callback(
  489. AlgoChecker<MatrixMul>("AARCH64_F32K8X12X1"));
  490. auto run = [&](size_t M, size_t N, size_t K) {
  491. auto k12x8_used = benchmarker_k12x8.exec({{K, M}, {N, K}, {}}) / RUNS;
  492. auto k8x12_used = benchmarker_k8x12.exec({{K, M}, {N, K}, {}}) / RUNS;
  493. float computations = 2.f * M * K * N * 1e-6;
  494. printf("run: {%zu{M} %zu{K} %zu{N}} float k12x8: %f ms %f Gflops "
  495. "k8x12: %f ms "
  496. "%f Gflops speedup: %f\n",
  497. M, K, N, k12x8_used, computations / k12x8_used, k8x12_used,
  498. computations / k8x12_used, k12x8_used / k8x12_used);
  499. };
  500. run(256, 12 * 24, 256);
  501. for (size_t M : {8, 64, 112, 256}) {
  502. for (size_t K : {8, 64, 112, 256}) {
  503. for (size_t N : {8, 64, 112, 256}) {
  504. run(M, N, K);
  505. }
  506. }
  507. }
  508. }
  509. TEST_F(AARCH64, BENCHMARK_MATRIX_MUL_FP32_K8X12_NO_TRANS) {
  510. constexpr size_t RUNS = 50;
  511. param::MatrixMul param;
  512. param.transposeA = param.transposeB = false;
  513. Benchmarker<MatrixMul> benchmarker_k12x8(handle());
  514. Benchmarker<MatrixMul> benchmarker_k8x12(handle());
  515. benchmarker_k12x8.set_param(param).set_display(false).set_times(RUNS);
  516. benchmarker_k8x12.set_param(param).set_display(false).set_times(RUNS);
  517. benchmarker_k12x8.set_before_exec_callback(
  518. AlgoChecker<MatrixMul>("AARCH64_F32K4X16X1"));
  519. benchmarker_k8x12.set_before_exec_callback(
  520. AlgoChecker<MatrixMul>("AARCH64_F32K8X12X1"));
  521. auto run = [&](size_t M, size_t N, size_t K) {
  522. auto k12x8_used = benchmarker_k12x8.exec({{M, K}, {K, N}, {}}) / RUNS;
  523. auto k8x12_used = benchmarker_k8x12.exec({{M, K}, {K, N}, {}}) / RUNS;
  524. float computations = 2.f * M * K * N * 1e-6;
  525. printf("run: {%zu{M} %zu{K} %zu{N}} float k12x8: %f ms %f Gflops "
  526. "k8x12: %f ms "
  527. "%f Gflops speedup: %f\n",
  528. M, K, N, k12x8_used, computations / k12x8_used, k8x12_used,
  529. computations / k8x12_used, k12x8_used / k8x12_used);
  530. };
  531. run(256, 12 * 24, 256);
  532. for (size_t M : {8, 64, 112, 256}) {
  533. for (size_t K : {8, 64, 112, 256}) {
  534. for (size_t N : {8, 64, 112, 256}) {
  535. run(M, N, K);
  536. }
  537. }
  538. }
  539. }
  540. #endif // MEGDNN_WITH_BENCHMARK
  541. // vim: syntax=cpp.doxygen

MegEngine 安装包中集成了使用 GPU 运行代码所需的 CUDA 环境,不用区分 CPU 和 GPU 版。 如果想要运行 GPU 程序,请确保机器本身配有 GPU 硬件设备并安装好驱动。 如果你想体验在云端 GPU 算力平台进行深度学习开发的感觉,欢迎访问 MegStudio 平台