def test_computation_agent():
discovery = Discovery('test', 'addr_test')
discovery.register_agent('a1', 'addr1')
discovery.register_computation('c1', 'a1')
discovery.register_computation('c2', 'a1')
assert discovery.computation_agent('c1') == 'a1'
assert discovery.computation_agent('c2') == 'a1'
with pytest.raises(UnknownComputation):
discovery.computation_agent('c3')
def _removal_candidate_computation_info(
orphan: str, departed: List[str], cg: ComputationGraph,
discovery: Discovery) \
-> Tuple[List[str], Dict[str, str], Dict[str, List[str]]]:
"""
All info needed by an agent to participate in negotiation about hosting
the computation `comp`
:param orphan: the candidate computation that must be hosted
:param departed: the agent that left the system
:param cg: the computation graph
:param discovery: the distribution of computation on agents
:return: a triple ( candidate_agents, fixed_neighbors, candidates_neighbors)
where:
* candidate agents is a list of agents that could host this computation
* fixed_neighbors is a map comp->agent that indicates, for each
neighbor computation of `comp` that is not a candidate (orphaned),
its host agent
* candidates_neighbors is a map comp -> List[agt] indicating which agent
could host each of the neighbor computation that is also a candidate
computation.
"""
orphaned_computation = _removal_orphaned_computations(departed, discovery)
candidate_agents = list(
discovery.replica_agents(orphan).difference(departed))
fixed_neighbors = {}
candidates_neighbors = {}
for n in cg.neighbors(orphan):
if n == orphan:
continue
if n in orphaned_computation:
candidates_neighbors[n] = \
list(discovery.replica_agents(n).difference(departed))
else:
fixed_neighbors[n] = discovery.computation_agent(n)
return candidate_agents, fixed_neighbors, candidates_neighbors