boost/boost_unordered_benchmarks
2
0
Fork 0
mirror of https://github.com/boostorg/boost_unordered_benchmarks.git synced 2026-01-23 17:32:12 +00:00
Code Issues Projects Releases Wiki Activity

optimized benchmarking

Browse Source
This commit is contained in:
joaquintides
2023-06-02 18:35:07 +02:00
parent 5f5c2d9820
commit fbd5f7d189
1 changed files with 55 additions and 36 deletions
Download Patch File Download Diff File Expand all files Collapse all files

91
parallel_load.cpp
View File

@@ -20,7 +20,7 @@ double measure(F f)
using namespace std::chrono;
static const int num_trials=10;
static const milliseconds min_time_per_trial(200);
static const milliseconds min_time_per_trial(10);
std::array<double,num_trials> trials;
for(int i=0;i<num_trials;++i){
@@ -55,6 +55,7 @@ void resume_timing()
#include <boost/bind/bind.hpp>
#include <boost/unordered/concurrent_flat_map.hpp>
#include <iostream>
#include <latch>
#include <random>
#include <thread>
#include <vector>
@@ -151,43 +152,61 @@ struct parallel_load
{
using result_type=std::size_t;
result_type operator()(int N,double theta,int num_threads)const
BOOST_NOINLINE result_type operator()(int N,double theta,int num_threads)const
{
pause_timing(); /* initializing zipf distributions is costly */
Map m;
std::vector<std::thread> threads;
std::vector<int> results(num_threads);
zipfian_int_distribution<int> zipf1{1,N,theta},
zipf2{N+1,2*N,theta};
resume_timing();
for(int i=0;i<num_threads;++i)threads.emplace_back([&,i,zipf1,zipf2]{
std::discrete_distribution<> dist({10,45,45});
std::mt19937_64 gen(std::size_t(282472+i*213731));
updater update{zipf1};
finder successful_find{zipf1},
unsuccessful_find{zipf2};
int n=i==0?(N+num_threads-1)/num_threads:N/num_threads;
for(int j=0;j<n;++j){
switch(dist(gen)){
case 0: update(m,gen); break;
case 1: successful_find(m,gen); break;
case 2:
default: unsuccessful_find(m,gen); break;
}
}
results[i]=successful_find.res+unsuccessful_find.res;
});
int res=0;
for(int i=0;i<num_threads;++i){
threads[i].join();
res+=results[i];
pause_timing();
{
Map m;
std::vector<std::thread> threads;
std::vector<int> results(num_threads);
zipfian_int_distribution<int> zipf1{1,N,theta},
zipf2{N+1,2*N,theta};
std::latch ready(num_threads),
start(1),
completed(num_threads),
die(1);
if constexpr(std::is_same_v<Map,tbb_map>)m.rehash(N);
for(int i=0;i<num_threads;++i)threads.emplace_back([&,i,zipf1,zipf2]{
std::discrete_distribution<> dist({10,45,45});
std::mt19937_64 gen(std::size_t(282472+i*213731));
updater update{zipf1};
finder successful_find{zipf1},
unsuccessful_find{zipf2};
ready.arrive_and_wait();
start.wait();
int n=i==0?(N+num_threads-1)/num_threads:N/num_threads;
for(int j=0;j<n;++j){
switch(dist(gen)){
case 0: update(m,gen); break;
case 1: successful_find(m,gen); break;
case 2:
default: unsuccessful_find(m,gen); break;
}
}
results[i]=successful_find.res+unsuccessful_find.res;
completed.count_down();
die.wait();
});
ready.wait();
resume_timing();
start.count_down();
completed.wait();
pause_timing();
die.count_down();
for(int i=0;i<num_threads;++i){
threads[i].join();
res+=results[i];
}
}
resume_timing();
return res;
}
};
@@ -196,7 +215,7 @@ template<
template<typename> class Tester,
typename Container1,typename Container2,typename Container3
>
void test(
BOOST_NOINLINE void test(
const char* title,int N,double theta,
const char* name1,const char* name2,const char* name3)
{