Irrellevant links

[0xfull]

Some links do not have be considered during Grounding if a message cannot traverse this link.

• How to define this mathematically?
• Does it prune search space effectively?
• How much?

[lu-hub77]

We could make use of the dimensions (x,y,z):

• If (dimension(destination_processor) - dimension(start_processor)) = 0, then #needed_links = 0

In each dimension a message should not move more far than its destination processor:

• For x, y, z: if (dimension(destination_processor) - dimension(start_processor)) > 0, then dimension(needed_links) <= dimension(destination_processor)
• For x, y, z: if (dimension(destination_processor) - dimension(start_processor)) < 0, then dimension(needed_links) >= dimension(destination_processor)

In each dimension a message should not move away from the shortest path to its destination processor / move in the wrong direction :

• If (dimension(destination_processor) - dimension(start_processor)) > 0, then dimension(needed_links) >= dimension(start_processor)
• If (dimension(destination_processor) - dimension(start_processor)) < 0, then dimension(needed_links) <= dimension(start_processor)

These rules are only allowing the shortest path between the start and destination processor, but this is maybe too restricting.
If the shortest path is blocked due to a different communication, a bit longer path might be a good option as well?? (Better path, if blocking_time(shortest path) > time(2 * #steps_done_too_far) for x, y, z )