Pieter Wuille
647fa37cdb
bench: add cluster linearization improvement benchmark
2024-07-25 10:16:40 -04:00
Pieter Wuille
28549791b3
clusterlin: permit passing in existing linearization to Linearize
...
This implements the LIMO algorithm for linearizing by improving an existing
linearization. See
https://delvingbitcoin.org/t/limo-combining-the-best-parts-of-linearization-search-and-merging
for details.
2024-07-25 10:16:40 -04:00
Pieter Wuille
d5918dc3c6
clusterlin: randomize the SearchCandidateFinder search order
...
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.
2024-07-25 10:16:40 -04:00
Pieter Wuille
d9b235e7d2
bench: Candidate finding and linearization benchmarks
...
Add benchmarks for known bad graphs for the purpose of search (as
an upper bound on work per search iterations) and ancestor sorting
(as an upper bound on linearization work with no search iterations).
2024-07-25 10:16:40 -04:00
