1940a72f1SSebastian Grimberg // Copyright (c) 2017-2022, Lawrence Livermore National Security, LLC and other CEED contributors. 2940a72f1SSebastian Grimberg // All Rights Reserved. See the top-level LICENSE and NOTICE files for details. 3940a72f1SSebastian Grimberg // 4940a72f1SSebastian Grimberg // SPDX-License-Identifier: BSD-2-Clause 5940a72f1SSebastian Grimberg // 6940a72f1SSebastian Grimberg // This file is part of CEED: http://github.com/ceed 7940a72f1SSebastian Grimberg 8f80f4a74SSebastian Grimberg #include <array> 9f80f4a74SSebastian Grimberg #include <limits> 10f80f4a74SSebastian Grimberg #include <vector> 11f80f4a74SSebastian Grimberg 12913f8461SSebastian Grimberg #include "ceed-magma-gemm-selector.h" 13913f8461SSebastian Grimberg 14f80f4a74SSebastian Grimberg #include "tuning/indices.h" 15f80f4a74SSebastian Grimberg #ifdef CEED_MAGMA_USE_HIP 16f80f4a74SSebastian Grimberg #include "tuning/mi100.h" 17f80f4a74SSebastian Grimberg #include "tuning/mi250x.h" 18f80f4a74SSebastian Grimberg #include "tuning/mi250x_grad_rtc.h" 19f80f4a74SSebastian Grimberg #include "tuning/mi250x_interp_rtc.h" 20f80f4a74SSebastian Grimberg #else 21f80f4a74SSebastian Grimberg #include "tuning/a100.h" 22f80f4a74SSebastian Grimberg #include "tuning/a100_grad_rtc.h" 23f80f4a74SSebastian Grimberg #include "tuning/a100_interp_rtc.h" 24f80f4a74SSebastian Grimberg #include "tuning/v100.h" 25f80f4a74SSebastian Grimberg #endif 26f80f4a74SSebastian Grimberg 27*26bdecf3SSebastian Grimberg // These definitions to force a certain parameter when generating autotuning data offline 28*26bdecf3SSebastian Grimberg // #define CEED_AUTOTUNE_GEMM_SELECTOR_N_BATCH 1 29*26bdecf3SSebastian Grimberg // #define CEED_AUTOTUNE_GEMM_SELECTOR_USE_MAGMA true 30*26bdecf3SSebastian Grimberg // #define CEED_AUTOTUNE_RTC_NB 1 31*26bdecf3SSebastian Grimberg 32f80f4a74SSebastian Grimberg //////////////////////////////////////////////////////////////////////////////// 33f80f4a74SSebastian Grimberg #ifdef CEED_MAGMA_USE_HIP 34940a72f1SSebastian Grimberg static inline auto gemm_selector_get_data(int gpu_arch, char precision, char trans_A) -> decltype(dgemm_nn_mi250x) { 35f80f4a74SSebastian Grimberg if (gpu_arch >= 910) { 36f80f4a74SSebastian Grimberg // gfx90a or newer 37940a72f1SSebastian Grimberg return (precision == 's') ? ((trans_A == 'n') ? sgemm_nn_mi250x : sgemm_tn_mi250x) : ((trans_A == 'n') ? dgemm_nn_mi250x : dgemm_tn_mi250x); 38f80f4a74SSebastian Grimberg } else { 39f80f4a74SSebastian Grimberg // gfx908 or older 40940a72f1SSebastian Grimberg return (precision == 's') ? ((trans_A == 'n') ? sgemm_nn_mi100 : sgemm_tn_mi100) : ((trans_A == 'n') ? dgemm_nn_mi100 : dgemm_tn_mi100); 41940a72f1SSebastian Grimberg } 42f80f4a74SSebastian Grimberg } 43f80f4a74SSebastian Grimberg #else 44940a72f1SSebastian Grimberg static inline auto gemm_selector_get_data(int gpu_arch, char precision, char trans_A) -> decltype(dgemm_nn_a100) { 45f80f4a74SSebastian Grimberg if (gpu_arch >= 800) { 46f80f4a74SSebastian Grimberg // sm80 or newer 47940a72f1SSebastian Grimberg return (precision == 's') ? ((trans_A == 'n') ? sgemm_nn_a100 : sgemm_tn_a100) : ((trans_A == 'n') ? dgemm_nn_a100 : dgemm_tn_a100); 48f80f4a74SSebastian Grimberg } else { 49f80f4a74SSebastian Grimberg // sm70 or older 50940a72f1SSebastian Grimberg return (precision == 's') ? ((trans_A == 'n') ? sgemm_nn_v100 : sgemm_tn_v100) : ((trans_A == 'n') ? dgemm_nn_v100 : dgemm_tn_v100); 51940a72f1SSebastian Grimberg } 52f80f4a74SSebastian Grimberg } 53f80f4a74SSebastian Grimberg #endif 54f80f4a74SSebastian Grimberg 55f80f4a74SSebastian Grimberg //////////////////////////////////////////////////////////////////////////////// 56f80f4a74SSebastian Grimberg void gemm_selector(int gpu_arch, char precision, char trans_A, int m, int n, int k, int *n_batch, int *use_magma) { 57*26bdecf3SSebastian Grimberg #if defined(CEED_AUTOTUNE_GEMM_SELECTOR_N_BATCH) && defined(CEED_AUTOTUNE_GEMM_SELECTOR_USE_MAGMA) 58*26bdecf3SSebastian Grimberg *n_batch = CEED_AUTOTUNE_GEMM_SELECTOR_N_BATCH; 59*26bdecf3SSebastian Grimberg *use_magma = CEED_AUTOTUNE_GEMM_SELECTOR_USE_MAGMA; 60*26bdecf3SSebastian Grimberg #else 61940a72f1SSebastian Grimberg const auto &data = gemm_selector_get_data(gpu_arch, precision, trans_A); 62f80f4a74SSebastian Grimberg int ir = -1; 63f80f4a74SSebastian Grimberg double norm = std::numeric_limits<double>::max(); 64940a72f1SSebastian Grimberg 65940a72f1SSebastian Grimberg for (size_t i = 0; i < data.size(); i++) { 66940a72f1SSebastian Grimberg const int &im = data[i][M_INDEX]; 67940a72f1SSebastian Grimberg const int &in = data[i][N_INDEX]; 68940a72f1SSebastian Grimberg const int &ik = data[i][K_INDEX]; 69f80f4a74SSebastian Grimberg 70f80f4a74SSebastian Grimberg double mdiff = (double)(im - m); 71f80f4a74SSebastian Grimberg double ndiff = (double)(in - n); 72f80f4a74SSebastian Grimberg double kdiff = (double)(ik - k); 73940a72f1SSebastian Grimberg double nrm = mdiff * mdiff + ndiff * ndiff + kdiff * kdiff; 74f80f4a74SSebastian Grimberg 75f80f4a74SSebastian Grimberg if (nrm < norm) { 76f80f4a74SSebastian Grimberg norm = nrm; 77f80f4a74SSebastian Grimberg ir = i; 78f80f4a74SSebastian Grimberg } 79f80f4a74SSebastian Grimberg 80940a72f1SSebastian Grimberg if (im == m && in == n && ik == k) { 81940a72f1SSebastian Grimberg // The input (m, n, k) exactly matches a record in `data`, no need to search further 82f80f4a74SSebastian Grimberg break; 83f80f4a74SSebastian Grimberg } 84f80f4a74SSebastian Grimberg } 85f80f4a74SSebastian Grimberg 86f80f4a74SSebastian Grimberg if (ir >= 0) { 87940a72f1SSebastian Grimberg // If the closest match indicates that n = n_batch, that means calling the regular non-batch GEMM. 88940a72f1SSebastian Grimberg // So n_batch is set to n instead of the 'n_batch' entry of the matching record. 89940a72f1SSebastian Grimberg int n_ = data[ir][N_INDEX]; 90940a72f1SSebastian Grimberg int n_batch_ = data[ir][N_BATCH_INDEX]; 91f80f4a74SSebastian Grimberg *n_batch = (n_ == n_batch_) ? n : n_batch_; 92940a72f1SSebastian Grimberg *use_magma = data[ir][USE_MAGMA_INDEX]; 93940a72f1SSebastian Grimberg } else { 94940a72f1SSebastian Grimberg *n_batch = n; 95940a72f1SSebastian Grimberg *use_magma = 0; 96f80f4a74SSebastian Grimberg } 97*26bdecf3SSebastian Grimberg #endif 98f80f4a74SSebastian Grimberg } 99f80f4a74SSebastian Grimberg 100940a72f1SSebastian Grimberg ////////////////////////////////////////////////////////////////////////////// 101f80f4a74SSebastian Grimberg #ifdef CEED_MAGMA_USE_HIP 102940a72f1SSebastian Grimberg static inline auto nontensor_rtc_get_data(int gpu_arch, char trans_A, int q_comp) -> decltype(dinterp_n_mi250x) { 103940a72f1SSebastian Grimberg if (q_comp == 1) { 104940a72f1SSebastian Grimberg return (trans_A == 'n') ? dinterp_n_mi250x : dinterp_t_mi250x; 105940a72f1SSebastian Grimberg } else { 106940a72f1SSebastian Grimberg return (trans_A == 'n') ? dgrad_n_mi250x : dgrad_t_mi250x; 107940a72f1SSebastian Grimberg } 108f80f4a74SSebastian Grimberg } 109f80f4a74SSebastian Grimberg #else 110940a72f1SSebastian Grimberg static inline auto nontensor_rtc_get_data(int gpu_arch, char trans_A, int q_comp) -> decltype(dinterp_n_a100) { 111940a72f1SSebastian Grimberg if (q_comp == 1) { 112940a72f1SSebastian Grimberg return (trans_A == 'n') ? dinterp_n_a100 : dinterp_t_a100; 113940a72f1SSebastian Grimberg } else { 114940a72f1SSebastian Grimberg return (trans_A == 'n') ? dgrad_n_a100 : dgrad_t_a100; 115940a72f1SSebastian Grimberg } 116f80f4a74SSebastian Grimberg } 117f80f4a74SSebastian Grimberg #endif 118f80f4a74SSebastian Grimberg 119f80f4a74SSebastian Grimberg //////////////////////////////////////////////////////////////////////////////// 120940a72f1SSebastian Grimberg CeedInt nontensor_rtc_get_nb(int gpu_arch, char trans_A, int q_comp, int P, int Q, int n) { 121*26bdecf3SSebastian Grimberg #ifdef CEED_AUTOTUNE_RTC_NB 122*26bdecf3SSebastian Grimberg return CEED_AUTOTUNE_RTC_NB; 123*26bdecf3SSebastian Grimberg #else 124940a72f1SSebastian Grimberg const auto &data = nontensor_rtc_get_data(gpu_arch, trans_A, q_comp); 125f80f4a74SSebastian Grimberg int ir = -1; 126f80f4a74SSebastian Grimberg double norm = std::numeric_limits<double>::max(); 127940a72f1SSebastian Grimberg CeedInt m = (trans_A == 'n') ? Q : P; 128940a72f1SSebastian Grimberg CeedInt k = (trans_A == 'n') ? P : Q; 129f80f4a74SSebastian Grimberg 130940a72f1SSebastian Grimberg for (size_t i = 0; i < data.size(); i++) { 131940a72f1SSebastian Grimberg const int &im = data[i][M_INDEX_RTC]; 132940a72f1SSebastian Grimberg const int &in = data[i][N_INDEX_RTC]; 133940a72f1SSebastian Grimberg const int &ik = data[i][K_INDEX_RTC]; 134940a72f1SSebastian Grimberg 135940a72f1SSebastian Grimberg double mdiff = (double)(im - m); 136940a72f1SSebastian Grimberg double ndiff = (double)(in - n); 137940a72f1SSebastian Grimberg double kdiff = (double)(ik - k); 138940a72f1SSebastian Grimberg double nrm = mdiff * mdiff + ndiff * ndiff + kdiff * kdiff; 139f80f4a74SSebastian Grimberg 140f80f4a74SSebastian Grimberg if (nrm < norm) { 141f80f4a74SSebastian Grimberg norm = nrm; 142f80f4a74SSebastian Grimberg ir = i; 143f80f4a74SSebastian Grimberg } 144f80f4a74SSebastian Grimberg 145940a72f1SSebastian Grimberg if (im == m && in == n && ik == k) { 146940a72f1SSebastian Grimberg // The input (m, n, k) exactly matches a record in `data`, no need to search further 147f80f4a74SSebastian Grimberg break; 148f80f4a74SSebastian Grimberg } 149f80f4a74SSebastian Grimberg } 150f80f4a74SSebastian Grimberg 151940a72f1SSebastian Grimberg return (ir >= 0) ? data[ir][NB_INDEX_RTC] : 1; 152*26bdecf3SSebastian Grimberg #endif 153f80f4a74SSebastian Grimberg } 154