pydcop.distribution.oilp_secp_cgdp

OILP-SECP-CGDP : Optimal ILP-based SECP Computation Graph Distribution

Distribution of a computation graph for a SECP, when using a constraint graph based DCOP algorithm

This distribution method only takes into account communication loads between computations, not hosting nor route cost.

This distribution method is designed for SECP and makes the following assumptions on the DCOP (which are always satisfied if the SECP has been generated using ‘pydcop generate’ command): * variables that represent an actuator are assigned to an agent, with an hosting cost of 0 * all agent must have a capacity attribute

distribution_cost(distribution: Distribution, computation_graph: ComputationConstraintsHyperGraph, agentsdef: Iterable[AgentDef], computation_memory: Callable[[ComputationNode], float], communication_load: Callable[[ComputationNode, str], float]) → float

Compute the cost of the distribution.

Only takes communication costs into account (no hosting nor route costs).

Parameters:

• distribution –

• computation_graph –

• agentsdef –

• computation_memory –

• communication_load –