Circuit Transformations, Loop Fusion, and Inductive Proof
Written with Samuel Coward
Are Datapath Circuit Transformations ≈\approx≈ Compiler Optimisations? During a visit to Cornell, Sam presented a bunch of hardware optimisations to fuse arithmetic operators. Being from a compiler background, Nate asked whether we could view these as more traditional compiler transformations.
TLDR: Yes, you can, but it gets pretty ugly…
In this blog, we’re going to show how we answered this question for a specific example, namely discovering carry-save addition (a hardware optimisation) via loop fusion (a compiler optimisation).
Are Datapath Circuit Transformations ≈\approx≈ Compiler Optimisations? During a visit to Cornell, Sam presented a bunch of hardware optimisations to fuse arithmetic operators. Being from a compiler background, Nate asked whether we could view these as more traditional compiler transformations.
TLDR: Yes, you can, but it gets pretty ugly…
In this blog, we’re going to show how we answered this question for a specific example, namely discovering carry-save addition (a hardware optimisation) via loop fusion (a compiler optimisation).
Summary not yet generated for this article.
Comments (1 of ) ⌛