highperfocused/bitcoin
1
0
Fork 0
mirror of https://github.com/bitcoin/bitcoin.git synced 2026-03-29 09:55:49 +02:00
Code Issues Packages Projects Releases Wiki Activity

clusterlin: randomize the SearchCandidateFinder search order

Browse Source 
To make search non-deterministic, change the BFS logic from always picking
the first queue item to randomly picking the first or second queue item.
This commit is contained in:
Pieter Wuille
2024-05-09 21:41:52 -04:00
parent 991ff9a9a4
commit d5918dc3c6
3 changed files with 44 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/bench/cluster_linearize.cpp
View File

@@ -101,8 +101,9 @@ void BenchLinearizePerIterWorstCase(ClusterIndex ntx, benchmark::Bench& bench)
{
const auto depgraph = MakeHardGraph<SetType>(ntx);
const auto iter_limit = std::min<uint64_t>(10000, uint64_t{1} << (ntx / 2 - 1));
uint64_t rng_seed = 0;
bench.batch(iter_limit).unit("iters").run([&] {
SearchCandidateFinder finder(depgraph);
SearchCandidateFinder finder(depgraph, rng_seed++);
auto [candidate, iters_performed] = finder.FindCandidateSet(iter_limit, {});
assert(iters_performed == iter_limit);
});
@@ -122,8 +123,9 @@ template<typename SetType>
void BenchLinearizeNoItersWorstCase(ClusterIndex ntx, benchmark::Bench& bench)
{
const auto depgraph = MakeLinearGraph<SetType>(ntx);
uint64_t rng_seed = 0;
bench.run([&] {
Linearize(depgraph, /*max_iterations=*/0);
Linearize(depgraph, /*max_iterations=*/0, rng_seed++);
});
}