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

Various queues: benchmark verilog from the wild against our Calyx-generated code #34

Open
anshumanmohan opened this issue Jul 22, 2024 · 1 comment

Comments

@anshumanmohan
Copy link
Contributor

This is sorta a pet issue of @polybeandip's and I want to put it down as a medium/low priority item!

We have at this point implemented a number of queue structures in Calyx, but we should not forget that many of these came from relatively recent research papers and themselves shipped with Verilog code. Other people's Verilog is not doubt going to be hard to understand and maintain (...and thus the sales pitch of Calyx itself) but that stuff could potentially be hand-optimized by the OG authors and could be blazing fast. Even if we suspect it is not all that good, it would be nice for us to be able to quantitatively say that our Calyx code beat them or was comparable to them.

A biggish challenge will be simply figuring out what the wild Verilog is even doing. Once we know that, we can tweak our Calyx implementations to match that behavior. Then we can benchmark.

@KabirSamsi
Copy link
Contributor

I think this should go hand-in-hand with #46 as a consideration of how we represent/compile to different queues with our DSL.

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