Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Reconnect stuck in sequences-18.log #33

Open
oskari1 opened this issue Apr 22, 2024 · 1 comment
Open

Reconnect stuck in sequences-18.log #33

oskari1 opened this issue Apr 22, 2024 · 1 comment

Comments

@oskari1
Copy link
Collaborator

oskari1 commented Apr 22, 2024

If I open the sequences-18.log and then apply the filter "Show quant k!354" then the tool gets stuck in the VisibleInstGraph::reconnect function, see here.

I've tried to limit the maximum number of edges to 1000 or so to inspect the intermediate graph of quant k!354 and saw that it adds a lot of edges, see screenshot below.
image

I'll also link two SVG files to inspect the subgraph of k!354 (dark purple nodes), once without and once with other quants:
sequences-18-k!354_2
sequences-18-k!354

My suspicion is that it's not a correctness issue but a performance issue, due to how the equality nodes are represented in the edges of the reconnected graph.

@oskari1 oskari1 changed the title Slow reconnect in sequences-18.log Reconnect gest stuck in sequences-18.log Apr 22, 2024
@oskari1 oskari1 changed the title Reconnect gest stuck in sequences-18.log Reconnect stuck in sequences-18.log Apr 22, 2024
@JonasAlaif
Copy link
Collaborator

@oskari1 I agree with your analysis. I expect it's probably an issue with a pattern like so:

   [V]
  /   \
[ ]   [ ]
  \   /
   [ ]
  /   \
[ ]   [ ]
  \   /
   [ ]
  /   \
[ ]   [ ]
  \   /
   [ ]
    |
   [V]

where if only the V nodes are visible, then one gets 2^3 indirect edges (grows exponentially with the hidden length). I think that we should change the reconnect to only consider immediate hidden children/parents, without enumerating all the paths between (such that there would only be 2 indirect edges in the above graph, for the 2 hidden children * 1 hidden parent)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants