A communication policy should provide the hardware topologie
of its network as a graph. Thus, the communication graph can
be mapped to the hardware graph. This issue is coupled
a little bit with issue #21 since a communication graph with
more vertices than available peers need to be partioned first
to be mapped to the hardware graph as second step.
How can this hardware graph be retrieved ?
By some communication benchmarks at initialization time
By some user input
By some network discovery tools (netloc, hwloc, lsnettopo, Libtopomap)
By the existing communication library (MPI virtual topologies)
A communication policy should provide the hardware topologie of its network as a graph. Thus, the communication graph can be mapped to the hardware graph. This issue is coupled a little bit with issue #21 since a communication graph with more vertices than available peers need to be partioned first to be mapped to the hardware graph as second step.
How can this hardware graph be retrieved ?