Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[Core][Benchmark] Adding benchmark for parallel_utilities #12942

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
+115 −2
Open

[Core][Benchmark] Adding benchmark for parallel_utilities #12942

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
9ee0dc1
Fix formatting of license comment in test_parallel_utilities.cpp
loumalouomega Dec 16, 2024
34cf343
Add benchmarks for parallel utilities in parallel_utilities_benchmark…
loumalouomega Dec 16, 2024
d09c941
Refactor benchmarks in parallel_utilities_benchmark.cpp to utilize bl…
loumalouomega Dec 17, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
29 changes: 19 additions & 10 deletions kratos/benchmarks/parallel_utilities_benchmark.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -48,7 +48,7 @@ static void BM_VectorPower(benchmark::State& state) {
std::vector<double> data_vector(nsize, 5.0);

for (auto _ : state) {
std::for_each(data_vector.begin(), data_vector.end(), [](double& item) {
block_for_each(data_vector, [](double& item) {
loumalouomega marked this conversation as resolved.
Show resolved Hide resolved
item = std::pow(item, 0.1);
});
}
Expand All @@ -57,11 +57,14 @@ static void BM_VectorPower(benchmark::State& state) {
// Benchmark for reduction
static void BM_VectorReduction(benchmark::State& state) {
int nsize = state.range(0);
const std::vector<double> data_vector(nsize, 5.0);
std::vector<double> data_vector(nsize, 5.0);

for (auto _ : state) {
double final_sum = std::accumulate(data_vector.begin(), data_vector.end(), 0.0);
benchmark::DoNotOptimize(final_sum);
auto final_sum = BlockPartition<std::vector<double>::iterator>(data_vector.begin(),
data_vector.end()).for_each<SumReduction<double>>(
[](double& item){
return item;
});
}
}

Expand All @@ -82,14 +85,20 @@ static void BM_ThreadLocalStorage(benchmark::State& state) {
elements.push_back(RHSElementType(rhs_vals[i]));
}

std::vector<double> tls(vec_size);
auto tls_lambda_manual_reduction = [](RHSElementType& rElem, std::vector<double>& rTLS)
{
rElem.CalculateRHS(rTLS);
double rhs_sum = std::accumulate(rTLS.begin(), rTLS.end(), 0.0);
rElem.SetAccumRHSValue(rhs_sum);
};

for (auto _ : state) {
for (auto& elem : elements) {
elem.CalculateRHS(tls);
double sum = std::accumulate(tls.begin(), tls.end(), 0.0);
elem.SetAccumRHSValue(sum);
}
BlockPartition<std::vector<RHSElementType>::iterator>(elements.begin(),
elements.end()).for_each(std::vector<double>(), tls_lambda_manual_reduction);

const double sum_elem_rhs_vals = std::accumulate(elements.begin(), elements.end(), 0.0, [](double acc, RHSElementType& rElem){
return acc + rElem.GetAccumRHSValue();
});
}
}

Expand Down
Loading