bffcc3bca0
Cisco wrote a bipartite graph solver to properly solve interface pair selection for usNIC. Using the reachable framework, the TCP BTL (and possibly the runtime network code) can use the graph solver to make more optimal pair selection. Jeff was happy to have the code more broadly used, but didn't have time to do the move, hence this commit. There are a couple of minor changes to the code compared to the usNIC version. Obviously, the functions have been renamed to match naming convention for their new home. Since it's easier to write unit tests for util/ code, the unit tests have been made first class tests run at "make check" time. This last bit required moving some of the definitions into a new header, bipartite_graph_internal.h, so that they could be included in both the library code and the test code. Signed-off-by: Brian Barrett <bbarrett@amazon.com> |
||
|---|---|---|
| .. | ||
| asm | ||
| carto | ||
| class | ||
| datatype | ||
| dss | ||
| event | ||
| memchecker | ||
| monitoring | ||
| mpi | ||
| runtime | ||
| support | ||
| threads | ||
| util | ||
| Makefile.am | ||