CodeQL / Analyze (actions) (push) Canceled after 0s
CodeQL / Analyze (python) (push) Canceled after 0s
pre-commit / pre-commit (push) Canceled after 0s
Multi-Arch CI / setup (push) Canceled after 0s
Publish build_manylinux_x86_64 images / publish_build_manylinux_x86_64 (push) Canceled after 0s
Setup (Multi-Arch) / setup (push) Canceled after 0s
Multi-Arch CI / Linux::${{ fromJSON(needs.setup.outputs.linux_build_config || '{}').build_variant_label || 'skip' }} (push) Canceled after 0s
Publish TheRock Docker image / build-and-push-image (push) Canceled after 0s
Publish no_rocm_image_ubi10 image / publish_no_rocm_image_ubi10 (push) Canceled after 0s
Multi-Arch CI / Windows::${{ fromJSON(needs.setup.outputs.windows_build_config || '{}').build_variant_label || 'skip' }} (push) Canceled after 0s
Publish TheRock Docker image / build-and-push-image (push) Canceled after 0s
Multi-Arch CI / Manifest Diff (push) Canceled after 0s
TheRock Manifest Diff Report / Generate Manifest Diff Report (push) Canceled after 0s
Multi-Arch CI / CI Summary (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04 images / publish_no_rocm_image_ubuntu24_04 (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04_ocl_rt images / publish_no_rocm_image_ubuntu24_04_ocl_rt (push) Canceled after 0s
Publish TheRock Docker image / build-and-push-image (push) Canceled after 0s
Publish TheRock Docker image / build-and-push-image (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04 images / publish_no_rocm_image_ubuntu24_04_rocgdb (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04_rocgdb images / publish_no_rocm_image_ubuntu24_04_rocgdb (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04 images / publish_no_rocm_image_ubuntu24_04_ocl_rt (push) Canceled after 0s
Publish TheRock Docker image / build-and-push-image (push) Canceled after 0s
Unit Tests / Unit Tests :: ubuntu-24.04 (push) Canceled after 0s
Unit Tests / Unit Tests :: windows-2022 (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04 images / publish_no_rocm_image_ubuntu24_04_media (push) Canceled after 0s
Unit Tests / Unit Tests Summary (push) Canceled after 0s
Publish no_rocm_image_ubuntu24_04 images / publish_no_rocm_image_ubuntu24_04_openmpi (push) Canceled after 0s
164 lines
6.4 KiB
C++
164 lines
6.4 KiB
C++
/*******************************************************************************
|
|
*
|
|
* MIT License
|
|
*
|
|
* Copyright (C) 2023-2025 Advanced Micro Devices, Inc. All rights reserved.
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
* in the Software without restriction, including without limitation the rights
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
* furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be included in
|
|
* all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
* SOFTWARE.
|
|
*
|
|
*******************************************************************************/
|
|
|
|
#pragma once
|
|
|
|
#include <set>
|
|
#include <vector>
|
|
|
|
#include <tensilelitehost/export.h>
|
|
|
|
namespace TensileLite
|
|
{
|
|
template <typename Value>
|
|
struct FreeSizeEntry
|
|
{
|
|
Value value;
|
|
};
|
|
/**
|
|
* \ingroup SolutionLibrary
|
|
*
|
|
* Uses a distance function to select solutions based on benchmarks.
|
|
* Benchmarks are performed to determine the optimal solution at a number of
|
|
* specific sizes. At runtime, we find the benchmarked size that is closest
|
|
* to the size asked for.
|
|
*/
|
|
template <typename MyProblem, typename MySolution = typename MyProblem::Solution>
|
|
struct ProblemFreeSizeLibrary : public SolutionLibrary<MyProblem, MySolution>
|
|
{
|
|
using Element = std::shared_ptr<SolutionLibrary<MyProblem, MySolution>>;
|
|
using Table = std::vector<FreeSizeEntry<Element>>;
|
|
std::shared_ptr<Table> table;
|
|
|
|
static std::string Type()
|
|
{
|
|
return "FreeSize";
|
|
}
|
|
virtual std::string type() const override
|
|
{
|
|
return Type();
|
|
}
|
|
virtual std::string description() const override
|
|
{
|
|
if(table == nullptr)
|
|
return concatenate(type(), ", table: nullptr");
|
|
return concatenate(type(), table->size());
|
|
}
|
|
|
|
virtual std::shared_ptr<MySolution> getSolutionByIndex(MyProblem const& problem,
|
|
Hardware const& hardware,
|
|
const int index) const override
|
|
{
|
|
std::shared_ptr<MySolution> solution;
|
|
return solution;
|
|
}
|
|
|
|
virtual std::shared_ptr<MySolution> findBestSolution(MyProblem const& problem,
|
|
Hardware const& hardware,
|
|
double* fitness
|
|
= nullptr) const override
|
|
{
|
|
std::shared_ptr<MySolution> solution;
|
|
return solution;
|
|
}
|
|
|
|
virtual SolutionSet<MySolution>
|
|
findAllSolutions(MyProblem const& problem,
|
|
Hardware const& hardware,
|
|
SolutionLibrarySearchType searchType
|
|
= SolutionLibrarySearchType::DEFAULT) const override
|
|
{
|
|
bool debug = Debug::Instance().printPropertyEvaluation();
|
|
SolutionSet<MySolution> rv;
|
|
if(searchType == SolutionLibrarySearchType::DEFAULT)
|
|
return rv;
|
|
|
|
for(auto const& row : *this->table)
|
|
{
|
|
if(debug)
|
|
std::cout << row.value->description() << std::endl;
|
|
|
|
auto rowSolutions = row.value->findAllSolutions(problem, hardware, searchType);
|
|
rv.insert(rowSolutions.begin(), rowSolutions.end());
|
|
|
|
if(debug)
|
|
std::cout << std::endl;
|
|
}
|
|
|
|
return rv;
|
|
}
|
|
|
|
virtual SolutionSet<MySolution>
|
|
findAllSolutionsGroupedGemm(std::vector<MyProblem> const& problems,
|
|
Hardware const& hardware,
|
|
SolutionLibrarySearchType searchType
|
|
= SolutionLibrarySearchType::DEFAULT) const override
|
|
{
|
|
bool debug = Debug::Instance().printPropertyEvaluation();
|
|
SolutionSet<MySolution> rv;
|
|
if(searchType == SolutionLibrarySearchType::DEFAULT)
|
|
return rv;
|
|
|
|
for(auto const& row : *this->table)
|
|
{
|
|
if(debug)
|
|
std::cout << row.value->description() << std::endl;
|
|
|
|
auto rowSolutions
|
|
= row.value->findAllSolutionsGroupedGemm(problems, hardware, searchType);
|
|
rv.insert(rowSolutions.begin(), rowSolutions.end());
|
|
|
|
if(debug)
|
|
std::cout << std::endl;
|
|
}
|
|
|
|
return rv;
|
|
}
|
|
|
|
virtual SolutionVector<MySolution> findTopSolutions(MyProblem const& problem,
|
|
Hardware const& hardware,
|
|
int numSolutions) const override
|
|
{
|
|
// TODO-
|
|
// Can remove this override since the base SolutionLibrary has done the same thing
|
|
// FreeSize pool is simply a table, no ranking information.
|
|
// Return empty to indicate not supported for heuristic.
|
|
SolutionVector<MySolution> solutions;
|
|
return solutions;
|
|
}
|
|
|
|
virtual SolutionVector<MySolution>
|
|
findTopSolutionsGroupedGemm(std::vector<MyProblem> const& problems,
|
|
Hardware const& hardware,
|
|
int numSolutions) const override
|
|
{
|
|
SolutionVector<MySolution> solutions;
|
|
return solutions;
|
|
}
|
|
};
|
|
} // namespace TensileLite
|
|
|