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 24 kB

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

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