mirror of
https://github.com/ROCm/composable_kernel.git
synced 2026-05-04 21:51:28 +00:00
Tests for CK Tile Batched Transpose and Smoothquant (#2453)
* Create tests for ck tile batched transpose using example * Create ck tile tests for smoothquant using examples * fix precision input strings and convert batched transpose to regression tests * Code cleanup and fix asserts * add missing licenses * update copyright and licensing in files * Update smoothquant tests to use example's smoothquant.cpp * Add custom target for batched transpose tests * Add missing new lines at end of files for CMakelists * fix typo in batched transpose CMakeList target_compile_options --------- Co-authored-by: root <root@ctr-ubbsmc16.amd.com>
This commit is contained in:
Emily Martins
274
test/ck_tile/smoothquant/smoothquant.inc
Normal file
274
test/ck_tile/smoothquant/smoothquant.inc
Normal file
@@ -0,0 +1,274 @@
|
||||
// Copyright © Advanced Micro Devices, Inc., or its affiliates.
|
||||
// SPDX-License-Identifier: MIT
|
||||
|
||||
#include "ck_tile/host.hpp"
|
||||
#include "smoothquant.hpp"
|
||||
#include <cstring>
|
||||
|
||||
// different threshold for different dtype
|
||||
template <typename DataType>
|
||||
auto get_elimit()
|
||||
{
|
||||
double rtol = 1e-5;
|
||||
double atol = 1e-5;
|
||||
return ck_tile::make_tuple(rtol, atol);
|
||||
}
|
||||
|
||||
template <>
|
||||
auto get_elimit<ck_tile::bf16_t>()
|
||||
{
|
||||
double rtol = 1e-5;
|
||||
double atol = 1e-5;
|
||||
return ck_tile::make_tuple(rtol, atol);
|
||||
}
|
||||
|
||||
template <>
|
||||
auto get_elimit<ck_tile::int8_t>()
|
||||
{
|
||||
// due to rounding, int8 quantization might have 1 abs error
|
||||
double rtol = 1;
|
||||
double atol = 1;
|
||||
return ck_tile::make_tuple(rtol, atol);
|
||||
}
|
||||
|
||||
auto create_args(int argc, char* argv[], int index = 0)
|
||||
{
|
||||
ck_tile::ArgParser arg_parser;
|
||||
arg_parser.insert("m", "3328", "m dimension")
|
||||
.insert("n", "4096", "n dimension")
|
||||
.insert("x_stride", "-1", "input stride per row, if -1 then equal to n")
|
||||
.insert("y_stride", "-1", "output stride per row, if -1 then equal to n")
|
||||
.insert("v", "1", "cpu validation or not")
|
||||
.insert("kname", "1", "print kernel name or not")
|
||||
.insert("prec", "fp16", "precision")
|
||||
.insert("warmup", "5", "cold iter")
|
||||
.insert("repeat", "20", "hot iter");
|
||||
|
||||
bool result = arg_parser.parse(argc, argv, index);
|
||||
return std::make_tuple(result, arg_parser);
|
||||
}
|
||||
|
||||
template <typename DataType>
|
||||
bool run(const ck_tile::ArgParser& arg_parser)
|
||||
{
|
||||
ck_tile::index_t m = arg_parser.get_int("m");
|
||||
ck_tile::index_t n = arg_parser.get_int("n");
|
||||
ck_tile::index_t x_stride = arg_parser.get_int("x_stride");
|
||||
if(x_stride < 0)
|
||||
x_stride = n;
|
||||
ck_tile::index_t y_stride = arg_parser.get_int("y_stride");
|
||||
if(y_stride < 0)
|
||||
y_stride = n;
|
||||
std::string data_type = arg_parser.get_str("prec");
|
||||
int kname = arg_parser.get_int("kname");
|
||||
int do_validation = arg_parser.get_int("v");
|
||||
int warmup = arg_parser.get_int("warmup");
|
||||
int repeat = arg_parser.get_int("repeat");
|
||||
|
||||
assert(x_stride >= n);
|
||||
|
||||
using TypeConfig = SmoothquantTypeConfig<DataType>;
|
||||
|
||||
using XDataType = typename TypeConfig::XDataType;
|
||||
using SmoothScaleDataType = typename TypeConfig::SmoothScaleDataType;
|
||||
using YScaleDataType = typename TypeConfig::YScaleDataType;
|
||||
using QYDataType = typename TypeConfig::QYDataType;
|
||||
using ComputeDataType = typename TypeConfig::ComputeDataType;
|
||||
|
||||
// host verify
|
||||
ck_tile::HostTensor<XDataType> x_host({m, n}, {x_stride, 1});
|
||||
ck_tile::HostTensor<SmoothScaleDataType> smscale_host({n});
|
||||
|
||||
ck_tile::HostTensor<YScaleDataType> yscale_host_ref({m}, {1});
|
||||
ck_tile::HostTensor<YScaleDataType> yscale_host_dev({m}, {1});
|
||||
|
||||
ck_tile::HostTensor<QYDataType> qy_host_ref({m, n}, {y_stride, 1});
|
||||
ck_tile::HostTensor<QYDataType> qy_host_dev({m, n}, {y_stride, 1});
|
||||
|
||||
ck_tile::FillUniformDistribution<XDataType>{-.5f, .5f}(x_host);
|
||||
ck_tile::FillUniformDistribution<SmoothScaleDataType>{1e-3, .5f}(smscale_host);
|
||||
|
||||
ck_tile::DeviceMem x_buf(x_host.get_element_space_size_in_bytes());
|
||||
ck_tile::DeviceMem smscale_buf(smscale_host.get_element_space_size_in_bytes());
|
||||
ck_tile::DeviceMem yscale_buf(yscale_host_dev.get_element_space_size_in_bytes());
|
||||
ck_tile::DeviceMem qy_buf(qy_host_dev.get_element_space_size_in_bytes());
|
||||
|
||||
x_buf.ToDevice(x_host.data());
|
||||
smscale_buf.ToDevice(smscale_host.data());
|
||||
|
||||
std::cout << "[" << data_type << "]"
|
||||
<< " m:" << m << ", n:" << n << ", x_stride:" << x_stride << ", y_stride:" << y_stride
|
||||
<< std::flush;
|
||||
|
||||
smoothquant_traits traits{data_type};
|
||||
|
||||
smoothquant_args args{x_buf.GetDeviceBuffer(),
|
||||
smscale_buf.GetDeviceBuffer(),
|
||||
yscale_buf.GetDeviceBuffer(),
|
||||
qy_buf.GetDeviceBuffer(),
|
||||
m,
|
||||
n,
|
||||
x_stride,
|
||||
y_stride};
|
||||
|
||||
float ave_time = smoothquant(
|
||||
traits, args, ck_tile::stream_config{nullptr, true, kname ? 1 : 0, warmup, repeat});
|
||||
|
||||
std::size_t num_byte = sizeof(XDataType) * m * n + sizeof(SmoothScaleDataType) * n +
|
||||
sizeof(YScaleDataType) * m + sizeof(QYDataType) * m * n;
|
||||
|
||||
float gb_per_sec = num_byte / 1.E6 / ave_time;
|
||||
std::cout << ", " << ave_time * 1.E3 << " us, " << gb_per_sec << " GB/s" << std::flush;
|
||||
|
||||
bool pass = true;
|
||||
|
||||
if(do_validation)
|
||||
{
|
||||
using YDataType = ComputeDataType;
|
||||
ck_tile::HostTensor<ComputeDataType> y_host({m, n}, {y_stride, 1});
|
||||
// smooth outlier
|
||||
{
|
||||
auto f = [&](auto n_) {
|
||||
auto v_smscale = ck_tile::type_convert<ComputeDataType>(smscale_host(n_));
|
||||
|
||||
for(int m_ = 0; m_ < m; ++m_)
|
||||
{
|
||||
auto v_x = ck_tile::type_convert<ComputeDataType>(x_host(m_, n_));
|
||||
y_host(m_, n_) = v_x * v_smscale;
|
||||
}
|
||||
};
|
||||
|
||||
ck_tile::make_ParallelTensorFunctor(f, smscale_host.get_element_space_size())(
|
||||
std::thread::hardware_concurrency());
|
||||
}
|
||||
|
||||
// yscale
|
||||
{
|
||||
ck_tile::HostTensor<YDataType> y_rowwise_amax_host({m});
|
||||
|
||||
using ReduceAmax = ck_tile::ReduceOp::AbsMax;
|
||||
ck_tile::reference_reduce<ComputeDataType, ComputeDataType, YDataType>(
|
||||
y_host, y_rowwise_amax_host, ReduceAmax{});
|
||||
|
||||
auto op = [](const auto& v0) {
|
||||
return v0 /
|
||||
ck_tile::type_convert<ComputeDataType>(ck_tile::numeric<QYDataType>::max());
|
||||
};
|
||||
ck_tile::reference_unary_elementwise<YDataType, YScaleDataType, ComputeDataType>(
|
||||
y_rowwise_amax_host, yscale_host_ref, op);
|
||||
|
||||
yscale_buf.FromDevice(yscale_host_dev.mData.data());
|
||||
|
||||
auto [rtol, atol] = get_elimit<YScaleDataType>();
|
||||
pass &= ck_tile::check_err(yscale_host_dev,
|
||||
yscale_host_ref,
|
||||
std::string("yscale Error: Incorrect results!"),
|
||||
rtol,
|
||||
atol);
|
||||
}
|
||||
|
||||
// rowwise quantization
|
||||
{
|
||||
ck_tile::reference_rowwise_quantization2d<YDataType, YScaleDataType, QYDataType>(
|
||||
y_host, yscale_host_ref, qy_host_ref);
|
||||
|
||||
qy_buf.FromDevice(qy_host_dev.data());
|
||||
auto [rtol, atol] = get_elimit<QYDataType>();
|
||||
|
||||
if(y_stride == n)
|
||||
{
|
||||
pass = ck_tile::check_err(qy_host_dev,
|
||||
qy_host_ref,
|
||||
std::string("qy Error: Incorrect results!"),
|
||||
rtol,
|
||||
atol);
|
||||
}
|
||||
else
|
||||
{
|
||||
for(int i_r = 0; i_r < m; i_r++)
|
||||
{
|
||||
std::vector<QYDataType> qy_host_dev_row(qy_host_dev.begin() + i_r * y_stride,
|
||||
qy_host_dev.begin() + i_r * y_stride +
|
||||
n);
|
||||
std::vector<QYDataType> qy_host_ref_row(qy_host_ref.begin() + i_r * y_stride,
|
||||
qy_host_ref.begin() + i_r * y_stride +
|
||||
n);
|
||||
pass &= ck_tile::check_err(qy_host_dev_row,
|
||||
qy_host_ref_row,
|
||||
std::string("qy[") + std::to_string(i_r) +
|
||||
std::string("] Error: Incorrect results!"),
|
||||
rtol,
|
||||
atol);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
std::cout << ", valid:" << (pass ? "y" : "n") << std::flush << std::endl;
|
||||
}
|
||||
|
||||
return pass;
|
||||
}
|
||||
|
||||
std::vector<std::vector<std::string>> create_test_cases(const std::string prec)
|
||||
{
|
||||
return {{"-prec=" + prec, "-m=99", "-n=13", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=17", "-n=16", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=1", "-n=100", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=4", "-n=128", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=80", "-n=127", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=22", "-n=255", "-x_stride=256"},
|
||||
{"-prec=" + prec, "-m=7", "-n=599", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=19", "-n=512", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=33", "-n=313", "-x_stride=1000"},
|
||||
{"-prec=" + prec, "-m=11", "-n=510", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=171", "-n=676", "-x_stride=818"},
|
||||
{"-prec=" + prec, "-m=91", "-n=636", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=12", "-n=768", "-x_stride=800"},
|
||||
{"-prec=" + prec, "-m=100", "-n=766", "-x_stride=812"},
|
||||
{"-prec=" + prec, "-m=31", "-n=1024", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=64", "-n=1000", "-x_stride=1004"},
|
||||
{"-prec=" + prec, "-m=8", "-n=1501", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=3", "-n=1826", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=5", "-n=2040", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=7", "-n=2734", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=1", "-n=3182", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=9", "-n=4096", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=3", "-n=8192", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=1", "-n=10547", "-x_stride=-1"},
|
||||
{"-prec=" + prec, "-m=3", "-n=17134", "-x_stride=-1"}};
|
||||
}
|
||||
|
||||
template <typename DataType>
|
||||
bool run_test_case(int argc, char* argv[])
|
||||
{
|
||||
auto [result, arg_parser] = create_args(argc, argv);
|
||||
if(!result)
|
||||
return false;
|
||||
|
||||
return run<DataType>(arg_parser);
|
||||
}
|
||||
|
||||
template <typename DataType>
|
||||
bool run_test_cases(std::vector<std::vector<std::string>>& test_cases)
|
||||
{
|
||||
bool valid = true;
|
||||
constexpr int num_args = 4;
|
||||
|
||||
char* argv[num_args];
|
||||
|
||||
for(std::size_t test_idx = 0; test_idx < test_cases.size(); ++test_idx)
|
||||
{
|
||||
assert(test_cases[test_idx].size() == num_args &&
|
||||
"invalid number of arguments in test case");
|
||||
for(std::size_t idx = 0; idx < num_args; ++idx)
|
||||
{
|
||||
argv[idx] = test_cases[test_idx][idx].data();
|
||||
}
|
||||
valid = valid && run_test_case<DataType>(num_args, argv);
|
||||
|
||||
if(!valid)
|
||||
break;
|
||||
}
|
||||
|
||||
return valid;
|
||||
}
|
||||
Reference in New Issue
Block a user