|
PBeFS
Parallel Best-First Search
|
the options of the parallel searches: those of the sequential search, and the parameters of the parallel ones [see ParallelParams], with batches of 64 nodes flushed every 64 expansions More...
#include <PBeFS/astar/HDAStar.h>
Additional Inherited Members | |
| Public Member Functions inherited from ParallelParams | |
| void | normalize (void) noexcept |
| sets to 1 any parameter that is 0 | |
| Public Attributes inherited from SearchOptions | |
| std::size_t | node_limit = 0 |
| stop with Status::node_limit after storing this many nodes (0 = no limit); in a parallel search the limit holds for each worker | |
| std::size_t | expected_nodes = 0 |
| the number of nodes the search is expected to store (0 = unknown): the closed list is sized for them at the start, instead of being doubled (and rehashed) as it fills; in a parallel search it is per worker | |
| Public Attributes inherited from ParallelParams | |
| unsigned | threads = 1 |
| the number of workers | |
| std::size_t | batch = 64 |
| nodes packed in a message | |
| unsigned | flush_period = 64 |
| steps between flushes of outboxes | |
| std::uint64_t | seed = 1 |
| seed of the owners | |
the options of the parallel searches: those of the sequential search, and the parameters of the parallel ones [see ParallelParams], with batches of 64 nodes flushed every 64 expansions