-
Notifications
You must be signed in to change notification settings - Fork 108
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
Add recursive partitioning ternary tree (RPTT) #1055
Conversation
Signed-off-by: Wenhao Lin <[email protected]>
Signed-off-by: Eddie Hung <[email protected]>
Signed-off-by: Eddie Hung <[email protected]>
Signed-off-by: Eddie Hung <[email protected]>
Signed-off-by: Eddie Hung <[email protected]>
Signed-off-by: Eddie Hung <[email protected]>
This PR brings in the Recursive Partition Ternary Tree technique as described in: @inproceedings{zang2024parallel,
title={An Open-Source Fast Parallel Routing Approach for Commercial FPGAs},
author={Zang, Xinshi and Lin, Wenhao and Lin, Shiju and Liu, Jinwei and Young, Evangeline FY},
booktitle={Proceedings of the Great Lakes Symposium on VLSI 2024},
year={2024}
} This technique is introduced across two new classes First up are the end-to-end wall clock results for Runtime is normalized to the baseline RWRoute wall time, and in ascending order to this time. Lower normalized numbers represent faster wall clock time, and normalized values less than 1.0 represent a speed up over RWRoute. Most of the benchmarks stay under 1.0 representing a speedup. Two lines are shown RPTT-only, and RPTT-with-HUS. For RPTT-only, two benchmarks ( For the largest designs ( Here's another figure of the CPU time, normalized again to the baseline result: Note that these numbers are for the end-to-end result, which includes reading the FPGA Interchange Format benchmarks and writing them (with routed results) all back out again. Geomean summary:
A few other bits of note:
|
This is a re-created PR of #1049. Related information can be seen in: