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

Expensive wire to node mapping #32

Open
acomodi opened this issue Apr 13, 2021 · 1 comment
Open

Expensive wire to node mapping #32

acomodi opened this issue Apr 13, 2021 · 1 comment

Comments

@acomodi
Copy link
Contributor

acomodi commented Apr 13, 2021

It is quite expensive, in terms of run-time, to build the Wire --> Node mapping: it takes ~10 seconds for a xc7a35t device, not a huge problem, but it may become one for bigger devices.

The Wire --> Node mapping is useful for lookups, specifically when trying to access all the other wires connected to a particular node for a given wire.

It might make sense to add a nodeIdx field to the wires, but I am unsure on the drawbacks of adding such a field.

@gatecat
Copy link
Collaborator

gatecat commented Apr 14, 2021

Long term, this might tie into routing graph folding too, there are efficient ways of folding routing graphs that get a fast bidirectional mapping without ever needing to flatten the graph.

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