dmeoli / PBeFS / 40394876170

push

github

The scaling of every parallel search with the number of cores on the academic problems: the domains of the examples (n queens, vacuum world, missionaries and cannibals, water jugs, traveling salesperson, the map of Romania) and the knapsack of the tests become headers of the library, sized up to 32 queens and cities and with the features and hashes of the distributions of HDA*; AStarBench solves them, the new BranchAndBoundBench runs every scheme of the branch-and-bound on every runtime, the farm and MPI on the knapsack and on the traveling salesperson; table F of campaign.sh runs every search on every number of cores twice against the sequential one and checks the costs, tables.py gives the speedups per problem, and the README describes the procedure

354 of 372 new or added lines in 8 files covered. (95.16%)

3566 of 3748 relevant lines covered (95.14%)

16802309.3 hits per line