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

made benchmark runs larger to amortize setup time

Browse Source
This commit is contained in:
joaquintides
2023-06-02 20:03:18 +02:00
parent b4ccd7aff5
commit f249ef245a
1 changed files with 5 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
parallel_load.cpp
View File

@@ -177,10 +177,11 @@ struct parallel_load
finder successful_find{zipf1},
unsuccessful_find{zipf2};
ready.arrive_and_wait();
ready.count_down();
start.wait();
int n=i==0?(N+num_threads-1)/num_threads:N/num_threads;
n*=10; /* so that #updates = N */
for(int j=0;j<n;++j){
switch(dist(gen)){
@@ -231,11 +232,11 @@ BOOST_NOINLINE void test(
for(int n=1;n<=num_threads;++n){
std::cout<<n<<";";
auto t=measure(boost::bind(Tester<Container1>(),N,theta,n));
std::cout<<N/t/1E6<<";";
std::cout<<10*N/t/1E6<<";";
t=measure(boost::bind(Tester<Container2>(),N,theta,n));
std::cout<<N/t/1E6<<";";
std::cout<<10*N/t/1E6<<";";
t=measure(boost::bind(Tester<Container3>(),N,theta,n));
std::cout<<N/t/1E6<<std::endl;
std::cout<<10*N/t/1E6<<std::endl;
}
}