Skip to content

[RouterLookahead] Router Lookahead Report #3161

New issue

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

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

Already on GitHub? # to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from

Conversation

AlexandreSinger
Copy link
Contributor

Added an option to generate a report on the router lookahead. This reports profiles the router lookahead by performing a set of trial routes from source RR nodes to all target RR nodes and comparing the estimated cost from the router lookahead to the actual cost of the path.

Notably, this report tries to show the mean squared error of the router lookahead and the maximum overestimation of the router lookahead.

The mean squared error is a measure of how accurate the router lookahead is. The more accurate the router lookahead is, the faster the path search will be (with less loss in quality). The max overestimation is a measure of the admissibility of the router lookahead heuristic. The more the router lookahead overestimates, the worse the quality of the path found (theoretically).

@AlexandreSinger
Copy link
Contributor Author

Here is an example of what the report looks like:
report_router_lookahead.txt

image

...

image

@AlexandreSinger
Copy link
Contributor Author

@amin1377 FYI, you might find this option interesting.

Added an option to generate a report on the router lookahead. This
reports profiles the router lookahead by performing a set of trial
routes from source RR nodes to all target RR nodes and comparing the
estimated cost from the router lookahead to the actual cost of the path.

Notably, this report tries to show the mean squared error of the router
lookahead and the maximum overestimation of the router lookahead.

The mean squared error is a measure of how accurate the router lookahead
is. The more accurate the router lookahead is, the faster the path
search will be (with less loss in quality). The max overestimation is a
measure of the admissibility of the router lookahead heuristic. The more
the router lookahead overestimates, the worse the quality of the path
found (theoretically).
@AlexandreSinger AlexandreSinger force-pushed the feature-lookahead-profile-report branch from d4026a5 to c60fde5 Compare June 24, 2025 03:51
@github-actions github-actions bot added VPR VPR FPGA Placement & Routing Tool docs Documentation lang-cpp C/C++ code labels Jun 24, 2025
# for free to join this conversation on GitHub. Already have an account? # to comment
Labels
docs Documentation lang-cpp C/C++ code VPR VPR FPGA Placement & Routing Tool
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant