dmeoli / PBeFS / 39132150009

95%

push

github

MPIBranchAndBoundSearch, the distributed branch-and-bound with one MPI process per worker

Each process has a queue and sends the children to their owners in
batches with non-blocking sends, the nodes travelling as bytes (a
trivially copyable node, or serialize() and deserialize() of the
problem); a new incumbent value is sent to all the processes, its node is
sent to all at the end, and the end is detected with the method of
Mattern, as in HDAStarMPI. The case bb-mpi of the tester checks it on the
0-1 knapsack with 1, 2 and 4 processes, and the tester initializes MPI
for every case that needs it.

254 of 267 new or added lines in 1 file covered. (95.13%)

2706 of 2905 relevant lines covered (93.15%)

23907595.37 hits per line