Skip to content

Optimize xilinx_async_bram_patch.tcl#350

Open
eirikwitt wants to merge 1 commit into
vortexgpgpu:masterfrom
eirikwitt:xillinx-bram-patching-optimization
Open

Optimize xilinx_async_bram_patch.tcl#350
eirikwitt wants to merge 1 commit into
vortexgpgpu:masterfrom
eirikwitt:xillinx-bram-patching-optimization

Conversation

@eirikwitt
Copy link
Copy Markdown

When running my Synthesis-to-Bitstream flow targeting a u250 FPGA, the runtime can get into the 100's of hours for large configurations. More than 90% of this time is spent running the xilinx_async_bram_patch.tcl script.

This patch reduces the runtime complexity from O(x²) to O(x) by not searching through all cells when finding descendants.
This reduces the worst case runtime by 94% from ~120 hours to ~7 for a 16 core 2 cluster configuration.
image

I do not have access to working FPGAs to test the generated bitstreams, but I verified my changes by running this modified version of the script on a wide range of configurations.

NB: This was not tested using Vortex's makefiles, but a modified version of Chipyards makefiles as a part of an attempt to run Vortex using FireSim, so results may vary.

This reduces the runtime complexity from O(x²) to O(x) by not searching through all cells when finding descendants.
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

Successfully merging this pull request may close these issues.

1 participant