Imperial College London > Talks@ee.imperial > CAS Talks > Automating Constraint-Aware Datapath Optimization using E-Graphs
Log inImperial users Other users No account?Information onFinding a talk Adding a talk Syndicating talks Who we are Everything else |
Automating Constraint-Aware Datapath Optimization using E-GraphsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact George A Constantinides. Numerical hardware design requires aggressive optimization, where designers exploit branch constraints, creating optimization opportunities that are valid only on a sub-domain of input space. We developed an RTL optimization tool that automatically learns the consequences of conditional branches and exploits that knowledge to enable deep optimization. The tool deploys custom built program analysis based on abstract interpretation theory, which when combined with a data-structure known as an e-graph simplifies complex reasoning about program properties. Our tool fully-automatically discovers known floating-point architectures from the computer arithmetic literature and out-performs baseline EDA tools, generating up to 33% faster and 41% smaller circuits. This talk is part of the CAS Talks series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsMetamaterials Type the title of a new list here Moving out to start a career? Peruse This First!Other talksTwo Applications of Compression in Group Testing and Multi-Armed Bandits Keynote Speech on Influence and persuasion |